Base | Representation |
---|---|
bin | 1001011000001011100001… |
… | …0001001110000100101000 |
3 | 1100111201112020010021200011 |
4 | 2112002320101032010220 |
5 | 2322413423314012412 |
6 | 33532451453421304 |
7 | 2112642341451433 |
oct | 226027021160450 |
9 | 40451466107604 |
10 | 10311013032232 |
11 | 331597005a450 |
12 | 11a641549a834 |
13 | 59a42a7c5543 |
14 | 2790acb7481a |
15 | 12d32e3b77a7 |
hex | 960b844e128 |
10311013032232 has 64 divisors (see below), whose sum is σ = 21225616228800. Its totient is φ = 4656859568640.
The previous prime is 10311013032211. The next prime is 10311013032277. The reversal of 10311013032232 is 23223031011301.
It is a Harshad number since it is a multiple of its sum of digits (22).
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, 56266098 + ... + 56449054.
It is an arithmetic number, because the mean of its divisors is an integer number (331650253575).
Almost surely, 210311013032232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10311013032232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10612808114400).
10311013032232 is an abundant number, since it is smaller than the sum of its proper divisors (10914603196568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10311013032232 is a wasteful number, since it uses less digits than its factorization.
10311013032232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187066 (or 187062 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10311013032232 its reverse (23223031011301), we get a palindrome (33534044043533).
The spelling of 10311013032232 in words is "ten trillion, three hundred eleven billion, thirteen million, thirty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •