Base | Representation |
---|---|
bin | 10010101001100001… |
… | …10000101110100000 |
3 | 221211202100110110112 |
4 | 21110300300232200 |
5 | 131001033100412 |
6 | 4333251550452 |
7 | 503051423540 |
oct | 112460605640 |
9 | 27752313415 |
10 | 10012003232 |
11 | 4278573240 |
12 | 1b34bbb428 |
13 | c37330a8a |
14 | 6ad9a9320 |
15 | 3d8e7e722 |
hex | 254c30ba0 |
10012003232 has 96 divisors (see below), whose sum is σ = 24665316480. Its totient is φ = 3886433280.
The previous prime is 10012003229. The next prime is 10012003249. The reversal of 10012003232 is 23230021001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 675194 + ... + 689862.
It is an arithmetic number, because the mean of its divisors is an integer number (256930380).
Almost surely, 210012003232 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 10012003232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12332658240).
10012003232 is an abundant number, since it is smaller than the sum of its proper divisors (14653313248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10012003232 is a wasteful number, since it uses less digits than its factorization.
10012003232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14974 (or 14966 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 10012003232 its reverse (23230021001), we get a palindrome (33242024233).
The spelling of 10012003232 in words is "ten billion, twelve million, three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •