Base | Representation |
---|---|
bin | 1001000110101101111010… |
… | …1101010100001111010100 |
3 | 1022110001011111220102122210 |
4 | 2101223132231110033110 |
5 | 2303010022104033022 |
6 | 33142554500153420 |
7 | 2052162110600103 |
oct | 221533655241724 |
9 | 38401144812583 |
10 | 10011010221012 |
11 | 320a711313029 |
12 | 115824b098870 |
13 | 57805a2211b8 |
14 | 26876d50003a |
15 | 125621850a0c |
hex | 91adeb543d4 |
10011010221012 has 24 divisors (see below), whose sum is σ = 23573326823200. Its totient is φ = 3306388696416.
The previous prime is 10011010220957. The next prime is 10011010221013. The reversal of 10011010221012 is 21012201011001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011010221013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3826837462 + ... + 3826840077.
Almost surely, 210011010221012 is an apocalyptic number.
10011010221012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10011010221012 is an abundant number, since it is smaller than the sum of its proper divisors (13562316602188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10011010221012 is a wasteful number, since it uses less digits than its factorization.
10011010221012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7653677655 (or 7653677653 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10011010221012 its reverse (21012201011001), we get a palindrome (31023211232013).
The spelling of 10011010221012 in words is "ten trillion, eleven billion, ten million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •