Base | Representation |
---|---|
bin | 1001000110101110010011… |
… | …0001100111100010111001 |
3 | 1022110001102121102221120221 |
4 | 2101223210301213202321 |
5 | 2303010224133340321 |
6 | 33143012534020041 |
7 | 2052164455031524 |
oct | 221534461474271 |
9 | 38401377387527 |
10 | 10011112011961 |
11 | 320a763818085 |
12 | 11582791a7621 |
13 | 578075340c28 |
14 | 26877cc39bbb |
15 | 12562a75ae41 |
hex | 91ae4c678b9 |
10011112011961 has 2 divisors, whose sum is σ = 10011112011962. Its totient is φ = 10011112011960.
The previous prime is 10011112011917. The next prime is 10011112012007. The reversal of 10011112011961 is 16911021111001.
It is a happy number.
10011112011961 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., 9992907256336 + 18204755625 = 3161156^2 + 134925^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011112011961 - 27 = 10011112011833 is a prime.
It is not a weakly prime, because it can be changed into another prime (10011112014961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005556005980 + 5005556005981.
It is an arithmetic number, because the mean of its divisors is an integer number (5005556005981).
Almost surely, 210011112011961 is an apocalyptic number.
It is an amenable number.
10011112011961 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011112011961 is an equidigital number, since it uses as much as digits as its factorization.
10011112011961 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 25.
Adding to 10011112011961 its reverse (16911021111001), we get a palindrome (26922133122962).
The spelling of 10011112011961 in words is "ten trillion, eleven billion, one hundred twelve million, eleven thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •