Base | Representation |
---|---|
bin | 11100001000001000… |
… | …011011110110000001 |
3 | 2212221202212220220000 |
4 | 130020020123312001 |
5 | 443323001400001 |
6 | 21512500310213 |
7 | 2116261651530 |
oct | 341010336601 |
9 | 85852786800 |
10 | 30201200001 |
11 | 11898876625 |
12 | 5a2a3a2369 |
13 | 2b03c7c65b |
14 | 1667060317 |
15 | bbb61da86 |
hex | 70821bd81 |
30201200001 has 40 divisors (see below), whose sum is σ = 51630912960. Its totient is φ = 17234236512.
The previous prime is 30201199999. The next prime is 30201200021. The reversal of 30201200001 is 10000210203.
It is a happy number.
It is not a de Polignac number, because 30201200001 - 21 = 30201199999 is a prime.
It is a super-3 number, since 3×302012000013 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (30201200021) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 382975 + ... + 455051.
It is an arithmetic number, because the mean of its divisors is an integer number (1290772824).
Almost surely, 230201200001 is an apocalyptic number.
It is an amenable number.
30201200001 is a deficient number, since it is larger than the sum of its proper divisors (21429712959).
30201200001 is an equidigital number, since it uses as much as digits as its factorization.
30201200001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72835 (or 72826 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 30201200001 its reverse (10000210203), we get a palindrome (40201410204).
It can be divided in two parts, 3020 and 1200001, that added together give a palindrome (1203021).
The spelling of 30201200001 in words is "thirty billion, two hundred one million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •