Base | Representation |
---|---|
bin | 1001001011111001011100… |
… | …0010000100101011101101 |
3 | 1022202112212111200000111001 |
4 | 2102332113002010223231 |
5 | 2310434301004002411 |
6 | 33251513223200301 |
7 | 2061462315430303 |
oct | 222762702045355 |
9 | 38675774600431 |
10 | 10100002015981 |
11 | 3244428916819 |
12 | 11715462a6091 |
13 | 5835701c2747 |
14 | 26cbb2556273 |
15 | 127ace429dc1 |
hex | 92f97084aed |
10100002015981 has 2 divisors, whose sum is σ = 10100002015982. Its totient is φ = 10100002015980.
The previous prime is 10100002015967. The next prime is 10100002016129. The reversal of 10100002015981 is 18951020000101.
10100002015981 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7615579813956 + 2484422202025 = 2759634^2 + 1576205^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100002015981 - 29 = 10100002015469 is a prime.
It is a super-2 number, since 2×101000020159812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100002015381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050001007990 + 5050001007991.
It is an arithmetic number, because the mean of its divisors is an integer number (5050001007991).
Almost surely, 210100002015981 is an apocalyptic number.
It is an amenable number.
10100002015981 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100002015981 is an equidigital number, since it uses as much as digits as its factorization.
10100002015981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 28.
The spelling of 10100002015981 in words is "ten trillion, one hundred billion, two million, fifteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •