Base | Representation |
---|---|
bin | 1100000111011001011000… |
… | …0111011101011110000011 |
3 | 1202011111101011210001110012 |
4 | 3001312112013131132003 |
5 | 3221223320300414021 |
6 | 44155402543055135 |
7 | 2543266024530212 |
oct | 301662607353603 |
9 | 52144334701405 |
10 | 13321212123011 |
11 | 4276548a61a71 |
12 | 15b18a6ba14ab |
13 | 75825333c0b0 |
14 | 340a70417079 |
15 | 1817ae1e435b |
hex | c1d961dd783 |
13321212123011 has 32 divisors (see below), whose sum is σ = 14505577329600. Its totient is φ = 12160179892224.
The previous prime is 13321212122983. The next prime is 13321212123031. The reversal of 13321212123011 is 11032121212331.
It is a happy number.
It is not a de Polignac number, because 13321212123011 - 226 = 13321145014147 is a prime.
It is a super-2 number, since 2×133212121230112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13321212123031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1274386061 + ... + 1274396513.
It is an arithmetic number, because the mean of its divisors is an integer number (453299291550).
Almost surely, 213321212123011 is an apocalyptic number.
13321212123011 is a deficient number, since it is larger than the sum of its proper divisors (1184365206589).
13321212123011 is a wasteful number, since it uses less digits than its factorization.
13321212123011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12455.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 13321212123011 its reverse (11032121212331), we get a palindrome (24353333335342).
The spelling of 13321212123011 in words is "thirteen trillion, three hundred twenty-one billion, two hundred twelve million, one hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •