Base | Representation |
---|---|
bin | 1100001000000001101001… |
… | …1011110111111001010001 |
3 | 1202012112021112110202122021 |
4 | 3002000122123313321101 |
5 | 3221412440113014413 |
6 | 44204351340211441 |
7 | 2544130635140155 |
oct | 302003233677121 |
9 | 52175245422567 |
10 | 13332022001233 |
11 | 4280095944521 |
12 | 15b3a03239b81 |
13 | 759286a5a740 |
14 | 3413b7d57065 |
15 | 181be322b18d |
hex | c201a6f7e51 |
13332022001233 has 16 divisors (see below), whose sum is σ = 14461267766400. Its totient is φ = 12217596393600.
The previous prime is 13332022001231. The next prime is 13332022001239. The reversal of 13332022001233 is 33210022023331.
It is not a de Polignac number, because 13332022001233 - 21 = 13332022001231 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13332022001198 and 13332022001207.
It is not an unprimeable number, because it can be changed into a prime (13332022001231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 79787748 + ... + 79954666.
It is an arithmetic number, because the mean of its divisors is an integer number (903829235400).
Almost surely, 213332022001233 is an apocalyptic number.
13332022001233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13332022001233 is a deficient number, since it is larger than the sum of its proper divisors (1129245765167).
13332022001233 is a wasteful number, since it uses less digits than its factorization.
13332022001233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211272.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 13332022001233 its reverse (33210022023331), we get a palindrome (46542044024564).
The spelling of 13332022001233 in words is "thirteen trillion, three hundred thirty-two billion, twenty-two million, one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •