Base | Representation |
---|---|
bin | 11100010000100110… |
… | …100001001110100100 |
3 | 2220022200021120001210 |
4 | 130100212201032210 |
5 | 444120341212400 |
6 | 21534534151420 |
7 | 2122635554304 |
oct | 342046411644 |
9 | 86280246053 |
10 | 30343304100 |
11 | 1196100552a |
12 | 5a69ab2570 |
13 | 2b27545615 |
14 | 167bc91604 |
15 | bc8d3d950 |
hex | 7109a13a4 |
30343304100 has 144 divisors (see below), whose sum is σ = 91403677568. Its totient is φ = 7764802560.
The previous prime is 30343304083. The next prime is 30343304107. The reversal of 30343304100 is 140334303.
It is a super-2 number, since 2×303433041002 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30343304107) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 791577 + ... + 829023.
Almost surely, 230343304100 is an apocalyptic number.
30343304100 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30343304100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45701838784).
30343304100 is an abundant number, since it is smaller than the sum of its proper divisors (61060373468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30343304100 is a wasteful number, since it uses less digits than its factorization.
30343304100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37574 (or 37567 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 30343304100 its reverse (140334303), we get a palindrome (30483638403).
The spelling of 30343304100 in words is "thirty billion, three hundred forty-three million, three hundred four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •