Base | Representation |
---|---|
bin | 10011001111010011011… |
… | …011010100001011110010 |
3 | 11200101120120101010102022 |
4 | 103033103123110023302 |
5 | 133130131120104020 |
6 | 2451210524351442 |
7 | 164342631352550 |
oct | 23172333241362 |
9 | 4611516333368 |
10 | 1322102113010 |
11 | 46a7781a2898 |
12 | 1942953a5582 |
13 | 9789b14c913 |
14 | 47dc0b0abd0 |
15 | 245ce4c4625 |
hex | 133d36d42f2 |
1322102113010 has 64 divisors (see below), whose sum is σ = 2928547664640. Its totient is φ = 419396904960.
The previous prime is 1322102113001. The next prime is 1322102113063. The reversal of 1322102113010 is 103112012231.
It is a super-2 number, since 2×13221021130102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1322102113010.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9345131 + ... + 9485550.
It is an arithmetic number, because the mean of its divisors is an integer number (45758557260).
Almost surely, 21322102113010 is an apocalyptic number.
1322102113010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1322102113010 is an abundant number, since it is smaller than the sum of its proper divisors (1606445551630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1322102113010 is a wasteful number, since it uses less digits than its factorization.
1322102113010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18830771.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1322102113010 its reverse (103112012231), we get a palindrome (1425214125241).
The spelling of 1322102113010 in words is "one trillion, three hundred twenty-two billion, one hundred two million, one hundred thirteen thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •