Base | Representation |
---|---|
bin | 1001001111000000011100… |
… | …1000110111110111000011 |
3 | 1022221122202110122110021022 |
4 | 2103300013020313313003 |
5 | 2312323202122013321 |
6 | 33332230132420055 |
7 | 2065363162603211 |
oct | 223600710676703 |
9 | 38848673573238 |
10 | 10153422454211 |
11 | 3265051304723 |
12 | 117b97477762b |
13 | 588604792cca |
14 | 2715dd253cb1 |
15 | 1291a9212dab |
hex | 93c07237dc3 |
10153422454211 has 2 divisors, whose sum is σ = 10153422454212. Its totient is φ = 10153422454210.
The previous prime is 10153422454207. The next prime is 10153422454249. The reversal of 10153422454211 is 11245422435101.
10153422454211 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 is a cyclic number.
It is not a de Polignac number, because 10153422454211 - 22 = 10153422454207 is a prime.
It is a super-2 number, since 2×101534224542112 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (10153422454261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5076711227105 + 5076711227106.
It is an arithmetic number, because the mean of its divisors is an integer number (5076711227106).
Almost surely, 210153422454211 is an apocalyptic number.
10153422454211 is a deficient number, since it is larger than the sum of its proper divisors (1).
10153422454211 is an equidigital number, since it uses as much as digits as its factorization.
10153422454211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38400, while the sum is 35.
Adding to 10153422454211 its reverse (11245422435101), we get a palindrome (21398844889312).
The spelling of 10153422454211 in words is "ten trillion, one hundred fifty-three billion, four hundred twenty-two million, four hundred fifty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •