Base | Representation |
---|---|
bin | 1001011000010011101111… |
… | …1100001100011100001000 |
3 | 1100111221020011220012211120 |
4 | 2112010323330030130020 |
5 | 2322432434330104112 |
6 | 33533455005555240 |
7 | 2113051154361306 |
oct | 226047374143410 |
9 | 40457204805746 |
10 | 10313222113032 |
11 | 33168a4021563 |
12 | 11a6931275b20 |
13 | 59a6c0386247 |
14 | 27923c2d7276 |
15 | 12d40d2c9e8c |
hex | 9613bf0c708 |
10313222113032 has 64 divisors (see below), whose sum is σ = 27305885376000. Its totient is φ = 3234788244480.
The previous prime is 10313222113027. The next prime is 10313222113043. The reversal of 10313222113032 is 23031122231301.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 10313222112993 and 10313222113011.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1055032 + ... + 4662567.
It is an arithmetic number, because the mean of its divisors is an integer number (426654459000).
Almost surely, 210313222113032 is an apocalyptic number.
10313222113032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10313222113032 is an abundant number, since it is smaller than the sum of its proper divisors (16992663262968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10313222113032 is a wasteful number, since it uses less digits than its factorization.
10313222113032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5722046 (or 5722042 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 10313222113032 its reverse (23031122231301), we get a palindrome (33344344344333).
The spelling of 10313222113032 in words is "ten trillion, three hundred thirteen billion, two hundred twenty-two million, one hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •