Base | Representation |
---|---|
bin | 10110111101111001000000… |
… | …011001001001010101110100 |
3 | 111020122110210000120020102111 |
4 | 112331321000121021111310 |
5 | 101214422212011413022 |
6 | 554455224205420404 |
7 | 30163511652526042 |
oct | 2675710031112564 |
9 | 436573700506374 |
10 | 101010121201012 |
11 | 2a2041740a9201 |
12 | b3b453126a704 |
13 | 44492a125670a |
14 | 1ad2cb752b392 |
15 | ba2789885477 |
hex | 5bde40649574 |
101010121201012 has 24 divisors (see below), whose sum is σ = 184467500582400. Its totient is φ = 48305459981856.
The previous prime is 101010121200991. The next prime is 101010121201019. The reversal of 101010121201012 is 210102121010101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101010121200983 and 101010121201001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101010121201019) 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, 41169687 + ... + 43554142.
It is an arithmetic number, because the mean of its divisors is an integer number (7686145857600).
Almost surely, 2101010121201012 is an apocalyptic number.
It is an amenable number.
101010121201012 is a deficient number, since it is larger than the sum of its proper divisors (83457379381388).
101010121201012 is a wasteful number, since it uses less digits than its factorization.
101010121201012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84736815 (or 84736813 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101010121201012 its reverse (210102121010101), we get a palindrome (311112242211113).
The spelling of 101010121201012 in words is "one hundred one trillion, ten billion, one hundred twenty-one million, two hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •