Base | Representation |
---|---|
bin | 1100000011001… |
… | …01000011100101 |
3 | 21001012020212210 |
4 | 12001211003211 |
5 | 201333432341 |
6 | 14010234033 |
7 | 2335066530 |
oct | 601450345 |
9 | 231166783 |
10 | 101077221 |
11 | 520678a3 |
12 | 29a25919 |
13 | 17c2cc0b |
14 | d5d1a17 |
15 | 8d18c16 |
hex | 60650e5 |
101077221 has 8 divisors (see below), whose sum is σ = 154022464. Its totient is φ = 57758400.
The previous prime is 101077199. The next prime is 101077231. The reversal of 101077221 is 122770101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101077221 - 210 = 101076197 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 4813201 = 101077221 / (1 + 0 + 1 + 0 + 7 + 7 + 2 + 2 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101077231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2406580 + ... + 2406621.
It is an arithmetic number, because the mean of its divisors is an integer number (19252808).
Almost surely, 2101077221 is an apocalyptic number.
It is an amenable number.
101077221 is a deficient number, since it is larger than the sum of its proper divisors (52945243).
101077221 is an equidigital number, since it uses as much as digits as its factorization.
101077221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4813211.
The product of its (nonzero) digits is 196, while the sum is 21.
The square root of 101077221 is about 10053.7167754020. The cubic root of 101077221 is about 465.8196066614.
The spelling of 101077221 in words is "one hundred one million, seventy-seven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •