Base | Representation |
---|---|
bin | 1100000110001110001000… |
… | …0110001110111001100010 |
3 | 1202002120020101202011110211 |
4 | 3001203202012032321202 |
5 | 3220410433040024442 |
6 | 44142222305044334 |
7 | 2541652322562652 |
oct | 301434206167142 |
9 | 52076211664424 |
10 | 13301012033122 |
11 | 4268a22599500 |
12 | 15a99aa0266aa |
13 | 756384378298 |
14 | 33dab5728362 |
15 | 180ecab02617 |
hex | c18e218ee62 |
13301012033122 has 48 divisors (see below), whose sum is σ = 22568767514496. Its totient is φ = 5870528848800.
The previous prime is 13301012033093. The next prime is 13301012033201. The reversal of 13301012033122 is 22133021010331.
It is a super-2 number, since 2×133010120331222 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 13301012033093 and 13301012033102.
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 23 ways as a sum of consecutive naturals, for example, 2883703 + ... + 5909125.
It is an arithmetic number, because the mean of its divisors is an integer number (470182656552).
Almost surely, 213301012033122 is an apocalyptic number.
13301012033122 is a deficient number, since it is larger than the sum of its proper divisors (9267755481374).
13301012033122 is a wasteful number, since it uses less digits than its factorization.
13301012033122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3025975 (or 3025964 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13301012033122 its reverse (22133021010331), we get a palindrome (35434033043453).
The spelling of 13301012033122 in words is "thirteen trillion, three hundred one billion, twelve million, thirty-three thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •