Base | Representation |
---|---|
bin | 1100000001000110101101… |
… | …0101000111101010100111 |
3 | 1201210011101001120101212201 |
4 | 3000101223111013222213 |
5 | 3212440432221213111 |
6 | 44034005031555331 |
7 | 2532421301514664 |
oct | 300215325075247 |
9 | 51704331511781 |
10 | 13213120101031 |
11 | 423471a916aa4 |
12 | 159495b22bb47 |
13 | 74acb820a186 |
14 | 3397387b6a6b |
15 | 17da848836c1 |
hex | c046b547aa7 |
13213120101031 has 2 divisors, whose sum is σ = 13213120101032. Its totient is φ = 13213120101030.
The previous prime is 13213120100989. The next prime is 13213120101119. The reversal of 13213120101031 is 13010102131231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13213120101031 - 29 = 13213120100519 is a prime.
It is a super-2 number, since 2×132131201010312 (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 (13213120101331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6606560050515 + 6606560050516.
It is an arithmetic number, because the mean of its divisors is an integer number (6606560050516).
Almost surely, 213213120101031 is an apocalyptic number.
13213120101031 is a deficient number, since it is larger than the sum of its proper divisors (1).
13213120101031 is an equidigital number, since it uses as much as digits as its factorization.
13213120101031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13213120101031 its reverse (13010102131231), we get a palindrome (26223222232262).
The spelling of 13213120101031 in words is "thirteen trillion, two hundred thirteen billion, one hundred twenty million, one hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •