Base | Representation |
---|---|
bin | 10010111001111110… |
… | …010111001011110000 |
3 | 1221101202000221200010 |
4 | 102321332113023300 |
5 | 313033300031112 |
6 | 13154203254520 |
7 | 1316024112252 |
oct | 227176271360 |
9 | 57352027603 |
10 | 20300002032 |
11 | 8677904a92 |
12 | 3b2651a440 |
13 | 1bb68a662b |
14 | da8099cd2 |
15 | 7dc27a63c |
hex | 4b9f972f0 |
20300002032 has 80 divisors (see below), whose sum is σ = 55070760960. Its totient is φ = 6431183616.
The previous prime is 20300002007. The next prime is 20300002043. The reversal of 20300002032 is 23020000302.
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 = 20300001999 and 20300002017.
It is a congruent number.
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, 114769 + ... + 231887.
It is an arithmetic number, because the mean of its divisors is an integer number (688384512).
Almost surely, 220300002032 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 20300002032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27535380480).
20300002032 is an abundant number, since it is smaller than the sum of its proper divisors (34770758928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20300002032 is a wasteful number, since it uses less digits than its factorization.
20300002032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117310 (or 117304 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 12.
Adding to 20300002032 its reverse (23020000302), we get a palindrome (43320002334).
The spelling of 20300002032 in words is "twenty billion, three hundred million, two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •