Base | Representation |
---|---|
bin | 11011111110101001… |
… | …001001100011011000 |
3 | 2212112200022220120200 |
4 | 123332221021203120 |
5 | 443011223104142 |
6 | 21445012222200 |
7 | 2112316550352 |
oct | 337651114330 |
9 | 85480286520 |
10 | 30042003672 |
11 | 11816a2300a |
12 | 59a500a960 |
13 | 2aa9cb0945 |
14 | 164dc600d2 |
15 | bac67464c |
hex | 6fea498d8 |
30042003672 has 96 divisors (see below), whose sum is σ = 85691876400. Its totient is φ = 9481874688.
The previous prime is 30042003671. The next prime is 30042003709. The reversal of 30042003672 is 27630024003.
It is a super-2 number, since 2×300420036722 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30042003671) 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 23 ways as a sum of consecutive naturals, for example, 3186838 + ... + 3196250.
Almost surely, 230042003672 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 30042003672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42845938200).
30042003672 is an abundant number, since it is smaller than the sum of its proper divisors (55649872728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30042003672 is a wasteful number, since it uses less digits than its factorization.
30042003672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11777 (or 11770 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 27.
Adding to 30042003672 its reverse (27630024003), we get a palindrome (57672027675).
The spelling of 30042003672 in words is "thirty billion, forty-two million, three thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •