Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …0101000011101011000001 |
3 | 1022102002120221011102201111 |
4 | 2101202100011003223001 |
5 | 2302324223341004303 |
6 | 33134235321403321 |
7 | 2051361415542352 |
oct | 221422005035301 |
9 | 38362527142644 |
10 | 10001101109953 |
11 | 3206496937248 |
12 | 1156344639541 |
13 | 57713b307485 |
14 | 2680ad479d29 |
15 | 125241947b6d |
hex | 91890143ac1 |
10001101109953 has 2 divisors, whose sum is σ = 10001101109954. Its totient is φ = 10001101109952.
The previous prime is 10001101109869. The next prime is 10001101110019. The reversal of 10001101109953 is 35990110110001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9997693819569 + 3407290384 = 3161913^2 + 58372^2 .
It is a cyclic number.
It is not a de Polignac number, because 10001101109953 - 229 = 10000564239041 is a prime.
It is not a weakly prime, because it can be changed into another prime (10001101103953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000550554976 + 5000550554977.
It is an arithmetic number, because the mean of its divisors is an integer number (5000550554977).
Almost surely, 210001101109953 is an apocalyptic number.
It is an amenable number.
10001101109953 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001101109953 is an equidigital number, since it uses as much as digits as its factorization.
10001101109953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1215, while the sum is 31.
Adding to 10001101109953 its reverse (35990110110001), we get a palindrome (45991211219954).
The spelling of 10001101109953 in words is "ten trillion, one billion, one hundred one million, one hundred nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •