Base | Representation |
---|---|
bin | 11010100011001001000… |
… | …11100011110100010110 |
3 | 10020012121012001222212210 |
4 | 31101210203203310112 |
5 | 104421211322010402 |
6 | 1535022414454250 |
7 | 122622443666460 |
oct | 15214443436426 |
9 | 3205535058783 |
10 | 912220110102 |
11 | 32196351a444 |
12 | 128964804386 |
13 | 680393c94a2 |
14 | 3221a33d130 |
15 | 18ae027a06c |
hex | d4648e3d16 |
912220110102 has 32 divisors (see below), whose sum is σ = 2085458556672. Its totient is φ = 260586314784.
The previous prime is 912220110077. The next prime is 912220110103. The reversal of 912220110102 is 201011022219.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (912220110103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1769028 + ... + 2225735.
It is an arithmetic number, because the mean of its divisors is an integer number (65170579896).
Almost surely, 2912220110102 is an apocalyptic number.
912220110102 is an abundant number, since it is smaller than the sum of its proper divisors (1173238446570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
912220110102 is a wasteful number, since it uses less digits than its factorization.
912220110102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4000212.
The product of its (nonzero) digits is 144, while the sum is 21.
The spelling of 912220110102 in words is "nine hundred twelve billion, two hundred twenty million, one hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.821 sec. • engine limits •