Base | Representation |
---|---|
bin | 10111000000111101100101… |
… | …101110101101110101010000 |
3 | 111021101122121112110112111202 |
4 | 113000331211232231311100 |
5 | 101231402004424310000 |
6 | 555140213334330332 |
7 | 30214663502355131 |
oct | 2700754556556520 |
9 | 437348545415452 |
10 | 101221201010000 |
11 | 2a285741158935 |
12 | b42941b4b99a8 |
13 | 446316cb94686 |
14 | 1add1bcd35c88 |
15 | ba7ee08b0dd5 |
hex | 5c0f65badd50 |
101221201010000 has 50 divisors (see below), whose sum is σ = 245066649789522. Its totient is φ = 40488480400000.
The previous prime is 101221201009939. The next prime is 101221201010029. The reversal of 101221201010000 is 10102122101.
It can be written as a sum of positive squares in 5 ways, for example, as 22933601521216 + 78287599488784 = 4788904^2 + 8848028^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 5061050051 + ... + 5061070050.
Almost surely, 2101221201010000 is an apocalyptic number.
101221201010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101221201010000 is an abundant number, since it is smaller than the sum of its proper divisors (143845448779522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101221201010000 is an equidigital number, since it uses as much as digits as its factorization.
101221201010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10122120129 (or 10122120108 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101221201010000 its reverse (10102122101), we get a palindrome (101231303132101).
The spelling of 101221201010000 in words is "one hundred one trillion, two hundred twenty-one billion, two hundred one million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •