Base | Representation |
---|---|
bin | 1001001100100010011100… |
… | …1110000000111011001010 |
3 | 1022210121021202000100111021 |
4 | 2103020213032000323022 |
5 | 2311124322304000020 |
6 | 33300533452023054 |
7 | 2062332164311534 |
oct | 223104716007312 |
9 | 38717252010437 |
10 | 10111011000010 |
11 | 3249068130428 |
12 | 11736b9161a8a |
13 | 584605c4438b |
14 | 26d5386c4854 |
15 | 128025b911aa |
hex | 93227380eca |
10111011000010 has 8 divisors (see below), whose sum is σ = 18199819800036. Its totient is φ = 4044404400000.
The previous prime is 10111011000001. The next prime is 10111011000059. The reversal of 10111011000010 is 1000011011101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 10110345824329 + 665175681 = 3179677^2 + 25791^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10111010999957 and 10111011000002.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 505550549991 + ... + 505550550010.
Almost surely, 210111011000010 is an apocalyptic number.
10111011000010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10111011000010 is a deficient number, since it is larger than the sum of its proper divisors (8088808800026).
10111011000010 is a wasteful number, since it uses less digits than its factorization.
10111011000010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1011101100008.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 10111011000010 its reverse (1000011011101), we get a palindrome (11111022011111).
The spelling of 10111011000010 in words is "ten trillion, one hundred eleven billion, eleven million, ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •