Base | Representation |
---|---|
bin | 10110111101111010110001… |
… | …001010001101001011110000 |
3 | 111020122122122212112011122202 |
4 | 112331322301022031023300 |
5 | 101214440100324010000 |
6 | 554500140031522332 |
7 | 30163606564506506 |
oct | 2675726112151360 |
9 | 436578585464582 |
10 | 101012013110000 |
11 | 2a204a55028453 |
12 | b3b497a9893a8 |
13 | 44495131b65a5 |
14 | 1ad30168ca676 |
15 | ba284a9e5dd5 |
hex | 5bdeb128d2f0 |
101012013110000 has 100 divisors (see below), whose sum is σ = 248004696330864. Its totient is φ = 39835723200000.
The previous prime is 101012013109981. The next prime is 101012013110003. The reversal of 101012013110000 is 11310210101.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (100).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101012013110003) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 70425221 + ... + 71845220.
Almost surely, 2101012013110000 is an apocalyptic number.
101012013110000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101012013110000 is an abundant number, since it is smaller than the sum of its proper divisors (146992683220864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101012013110000 is an equidigital number, since it uses as much as digits as its factorization.
101012013110000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142270540 (or 142270519 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 101012013110000 its reverse (11310210101), we get a palindrome (101023323320101).
The spelling of 101012013110000 in words is "one hundred one trillion, twelve billion, thirteen million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •