Base | Representation |
---|---|
bin | 1100000111010101010100… |
… | …1001110110101000011011 |
3 | 1202011101120012221211010101 |
4 | 3001311111021312220123 |
5 | 3221214102242400243 |
6 | 44155102451000231 |
7 | 2543230021564345 |
oct | 301652511665033 |
9 | 52141505854111 |
10 | 13320122231323 |
11 | 4276039821236 |
12 | 15b1641b99077 |
13 | 75810b5ba37b |
14 | 3409a978a295 |
15 | 1817486a854d |
hex | c1d55276a1b |
13320122231323 has 2 divisors, whose sum is σ = 13320122231324. Its totient is φ = 13320122231322.
The previous prime is 13320122231303. The next prime is 13320122231363. The reversal of 13320122231323 is 32313222102331.
It is a happy number.
13320122231323 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 13320122231323 - 213 = 13320122223131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13320122231291 and 13320122231300.
It is not a weakly prime, because it can be changed into another prime (13320122231303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660061115661 + 6660061115662.
It is an arithmetic number, because the mean of its divisors is an integer number (6660061115662).
Almost surely, 213320122231323 is an apocalyptic number.
13320122231323 is a deficient number, since it is larger than the sum of its proper divisors (1).
13320122231323 is an equidigital number, since it uses as much as digits as its factorization.
13320122231323 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 13320122231323 its reverse (32313222102331), we get a palindrome (45633344333654).
The spelling of 13320122231323 in words is "thirteen trillion, three hundred twenty billion, one hundred twenty-two million, two hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •