Base | Representation |
---|---|
bin | 11110000010011011111… |
… | …01111001010000111101 |
3 | 10122200000211122122211122 |
4 | 33001031331321100331 |
5 | 113402220124101023 |
6 | 2110050145400325 |
7 | 134365256065100 |
oct | 17011575712075 |
9 | 3580024578748 |
10 | 1032100222013 |
11 | 3687907398a3 |
12 | 1480403390a5 |
13 | 764327c8853 |
14 | 37d4d798737 |
15 | 1bca994d2c8 |
hex | f04df7943d |
1032100222013 has 12 divisors (see below), whose sum is σ = 1200622956480. Its totient is φ = 884645119512.
The previous prime is 1032100222009. The next prime is 1032100222037. The reversal of 1032100222013 is 3102220012301.
It is not a de Polignac number, because 1032100222013 - 22 = 1032100222009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1032100221982 and 1032100222000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032100222613) 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 11 ways as a sum of consecutive naturals, for example, 6614270 + ... + 6768512.
It is an arithmetic number, because the mean of its divisors is an integer number (100051913040).
Almost surely, 21032100222013 is an apocalyptic number.
It is an amenable number.
1032100222013 is a deficient number, since it is larger than the sum of its proper divisors (168522734467).
1032100222013 is a wasteful number, since it uses less digits than its factorization.
1032100222013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290816 (or 290809 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1032100222013 its reverse (3102220012301), we get a palindrome (4134320234314).
The spelling of 1032100222013 in words is "one trillion, thirty-two billion, one hundred million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •