Base | Representation |
---|---|
bin | 11011111110100001… |
… | …101000001111001001 |
3 | 2212112112121202020020 |
4 | 123332201220033021 |
5 | 443010222012301 |
6 | 21444502051053 |
7 | 2112264026544 |
oct | 337641501711 |
9 | 85475552206 |
10 | 30040032201 |
11 | 118158a68a3 |
12 | 59a4419a89 |
13 | 2aa97704aa |
14 | 164d8a985b |
15 | bac3d5436 |
hex | 6fe8683c9 |
30040032201 has 8 divisors (see below), whose sum is σ = 40078684800. Its totient is φ = 20014033872.
The previous prime is 30040032199. The next prime is 30040032203. The reversal of 30040032201 is 10223004003.
It is an interprime number because it is at equal distance from previous prime (30040032199) and next prime (30040032203).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30040032201 - 21 = 30040032199 is a prime.
It is a super-4 number, since 4×300400322014 (a number of 43 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (30040032203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3158026 + ... + 3167523.
It is an arithmetic number, because the mean of its divisors is an integer number (5009835600).
Almost surely, 230040032201 is an apocalyptic number.
It is an amenable number.
30040032201 is a deficient number, since it is larger than the sum of its proper divisors (10038652599).
30040032201 is a wasteful number, since it uses less digits than its factorization.
30040032201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6327135.
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 30040032201 its reverse (10223004003), we get a palindrome (40263036204).
The spelling of 30040032201 in words is "thirty billion, forty million, thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •