Base | Representation |
---|---|
bin | 10010101010100000… |
… | …11010100011101000 |
3 | 221212022222000220110 |
4 | 21111100122203220 |
5 | 131010144113112 |
6 | 4334145454320 |
7 | 503212103430 |
oct | 112520324350 |
9 | 27768860813 |
10 | 10020301032 |
11 | 4282220525 |
12 | 1b379413a0 |
13 | c38c77911 |
14 | 6b0b292c0 |
15 | 3d9a6d13c |
hex | 25541a8e8 |
10020301032 has 64 divisors (see below), whose sum is σ = 28636848000. Its totient is φ = 2862201600.
The previous prime is 10020301021. The next prime is 10020301043. The reversal of 10020301032 is 23010302001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10020301021) and next prime (10020301043).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 10020300999 and 10020301017.
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, 1264282 + ... + 1272182.
It is an arithmetic number, because the mean of its divisors is an integer number (447450750).
Almost surely, 210020301032 is an apocalyptic number.
10020301032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10020301032 is an abundant number, since it is smaller than the sum of its proper divisors (18616546968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10020301032 is a wasteful number, since it uses less digits than its factorization.
10020301032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15466 (or 15462 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 10020301032 its reverse (23010302001), we get a palindrome (33030603033).
The spelling of 10020301032 in words is "ten billion, twenty million, three hundred one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •