Base | Representation |
---|---|
bin | 1001000110110001011010… |
… | …0101011100011001111001 |
3 | 1022110010120211220100112221 |
4 | 2101230112211130121321 |
5 | 2303013432101301101 |
6 | 33143231505204041 |
7 | 2052224253065551 |
oct | 221542645343171 |
9 | 38403524810487 |
10 | 10011947681401 |
11 | 3210052500986 |
12 | 1158471030621 |
13 | 5781795024a3 |
14 | 26881bc0c161 |
15 | 125678ccbaa1 |
hex | 91b1695c679 |
10011947681401 has 2 divisors, whose sum is σ = 10011947681402. Its totient is φ = 10011947681400.
The previous prime is 10011947681381. The next prime is 10011947681501. The reversal of 10011947681401 is 10418674911001.
10011947681401 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., 6721061435001 + 3290886246400 = 2592501^2 + 1814080^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011947681401 - 223 = 10011939292793 is a prime.
It is a super-2 number, since 2×100119476814012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10011947681501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005973840700 + 5005973840701.
It is an arithmetic number, because the mean of its divisors is an integer number (5005973840701).
Almost surely, 210011947681401 is an apocalyptic number.
It is an amenable number.
10011947681401 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011947681401 is an equidigital number, since it uses as much as digits as its factorization.
10011947681401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48384, while the sum is 43.
The spelling of 10011947681401 in words is "ten trillion, eleven billion, nine hundred forty-seven million, six hundred eighty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •