Base | Representation |
---|---|
bin | 10110111111101001110001… |
… | …110111000110111001101010 |
3 | 111021002001022220220220112102 |
4 | 112333221301313012321222 |
5 | 101223413204304120320 |
6 | 555031011523413402 |
7 | 30205326444323216 |
oct | 2677516167067152 |
9 | 437061286826472 |
10 | 101131210223210 |
11 | 2a25056175a872 |
12 | b413aa5824262 |
13 | 445782ac49acb |
14 | 1ad8ac3355946 |
15 | ba59c5254175 |
hex | 5bfa71dc6e6a |
101131210223210 has 16 divisors (see below), whose sum is σ = 182036367529992. Its totient is φ = 40452442060800.
The previous prime is 101131210223201. The next prime is 101131210223261. The reversal of 101131210223210 is 12322012131101.
It can be written as a sum of positive squares in 4 ways, for example, as 70870418260849 + 30260791962361 = 8418457^2 + 5500981^2 .
It is a super-2 number, since 2×1011312102232102 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6000770 + ... + 15436050.
Almost surely, 2101131210223210 is an apocalyptic number.
101131210223210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101131210223210 is a deficient number, since it is larger than the sum of its proper divisors (80905157306782).
101131210223210 is a wasteful number, since it uses less digits than its factorization.
101131210223210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10507129.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 101131210223210 its reverse (12322012131101), we get a palindrome (113453222354311).
The spelling of 101131210223210 in words is "one hundred one trillion, one hundred thirty-one billion, two hundred ten million, two hundred twenty-three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •