Base | Representation |
---|---|
bin | 1100000001000110010011… |
… | …0101010110100101001110 |
3 | 1201210011002110111002121002 |
4 | 3000101210311112211032 |
5 | 3212440221321011342 |
6 | 44033550135540302 |
7 | 2532415506225350 |
oct | 300214465264516 |
9 | 51704073432532 |
10 | 13213011110222 |
11 | 4234674344650 |
12 | 159492a82a692 |
13 | 74ac9b769281 |
14 | 3397281250d0 |
15 | 17da7a004d32 |
hex | c0464d5694e |
13213011110222 has 32 divisors (see below), whose sum is σ = 24710951957760. Its totient is φ = 5147737822080.
The previous prime is 13213011110177. The next prime is 13213011110309. The reversal of 13213011110222 is 22201111031231.
It is a super-3 number, since 3×132130111102223 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13213011110194 and 13213011110203.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2683238 + ... + 5798774.
It is an arithmetic number, because the mean of its divisors is an integer number (772217248680).
Almost surely, 213213011110222 is an apocalyptic number.
13213011110222 is a deficient number, since it is larger than the sum of its proper divisors (11497940847538).
13213011110222 is a wasteful number, since it uses less digits than its factorization.
13213011110222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3143096.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 13213011110222 its reverse (22201111031231), we get a palindrome (35414122141453).
The spelling of 13213011110222 in words is "thirteen trillion, two hundred thirteen billion, eleven million, one hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •