Base | Representation |
---|---|
bin | 1100000110110100001000… |
… | …0001000000011010110110 |
3 | 1202010112120012022001111020 |
4 | 3001231002001000122312 |
5 | 3221042330032213142 |
6 | 44151030324522010 |
7 | 2542463136264516 |
oct | 301550201003266 |
9 | 52115505261436 |
10 | 13311211210422 |
11 | 4272286784354 |
12 | 15ab975850306 |
13 | 75731b3c2438 |
14 | 3403a20d7846 |
15 | 1813c6205cec |
hex | c1b420406b6 |
13311211210422 has 32 divisors (see below), whose sum is σ = 27551832328800. Its totient is φ = 4282295367168.
The previous prime is 13311211210391. The next prime is 13311211210469. The reversal of 13311211210422 is 22401211211331.
It is a super-2 number, since 2×133112112104222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13311211210392 and 13311211210401.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15405097 + ... + 16246212.
It is an arithmetic number, because the mean of its divisors is an integer number (860994760275).
Almost surely, 213311211210422 is an apocalyptic number.
13311211210422 is an abundant number, since it is smaller than the sum of its proper divisors (14240621118378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13311211210422 is a wasteful number, since it uses less digits than its factorization.
13311211210422 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31653760.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 13311211210422 its reverse (22401211211331), we get a palindrome (35712422421753).
Subtracting 13311211210422 from its reverse (22401211211331), we obtain a palindrome (9090000000909).
The spelling of 13311211210422 in words is "thirteen trillion, three hundred eleven billion, two hundred eleven million, two hundred ten thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •