Base | Representation |
---|---|
bin | 1001001100100011001010… |
… | …0010110011111000110010 |
3 | 1022210121202222112101212100 |
4 | 2103020302202303320302 |
5 | 2311130214424013020 |
6 | 33301004400241230 |
7 | 2062336662302364 |
oct | 223106242637062 |
9 | 38717688471770 |
10 | 10111201001010 |
11 | 3249155403a4a |
12 | 1173750910216 |
13 | 58463640a3c5 |
14 | 26d555a22d34 |
15 | 1280376c2a90 |
hex | 932328b3e32 |
10111201001010 has 48 divisors (see below), whose sum is σ = 26999639438616. Its totient is φ = 2623446745344.
The previous prime is 10111201000997. The next prime is 10111201001039. The reversal of 10111201001010 is 1010010211101.
It can be written as a sum of positive squares in 4 ways, for example, as 8893451231721 + 1217749769289 = 2982189^2 + 1103517^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10111201000983 and 10111201001001.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1518195019 + ... + 1518201678.
Almost surely, 210111201001010 is an apocalyptic number.
10111201001010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10111201001010 is an abundant number, since it is smaller than the sum of its proper divisors (16888438437606).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111201001010 is a wasteful number, since it uses less digits than its factorization.
10111201001010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3036396747 (or 3036396744 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10111201001010 its reverse (1010010211101), we get a palindrome (11121211212111).
The spelling of 10111201001010 in words is "ten trillion, one hundred eleven billion, two hundred one million, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •