Base | Representation |
---|---|
bin | 10111000000110011001010… |
… | …110100011101100001001101 |
3 | 111021100120201202120200021011 |
4 | 113000303022310131201031 |
5 | 101231211101100103343 |
6 | 555131123201405221 |
7 | 30214116310330111 |
oct | 2700631264354115 |
9 | 437316652520234 |
10 | 101210012112973 |
11 | 2a280a1a3309a5 |
12 | b427218339811 |
13 | 44620a8a9c64a |
14 | 1adc83ad33741 |
15 | ba7a8845c29d |
hex | 5c0ccad1d84d |
101210012112973 has 2 divisors, whose sum is σ = 101210012112974. Its totient is φ = 101210012112972.
The previous prime is 101210012112863. The next prime is 101210012112997. The reversal of 101210012112973 is 379211210012101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 74970436151209 + 26239575961764 = 8658547^2 + 5122458^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101210012112973 is a prime.
It is a super-3 number, since 3×1012100121129733 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101210012112673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50605006056486 + 50605006056487.
It is an arithmetic number, because the mean of its divisors is an integer number (50605006056487).
Almost surely, 2101210012112973 is an apocalyptic number.
It is an amenable number.
101210012112973 is a deficient number, since it is larger than the sum of its proper divisors (1).
101210012112973 is an equidigital number, since it uses as much as digits as its factorization.
101210012112973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 31.
The spelling of 101210012112973 in words is "one hundred one trillion, two hundred ten billion, twelve million, one hundred twelve thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •