Base | Representation |
---|---|
bin | 11100001000110001… |
… | …110000001000011000 |
3 | 2212222112021012020010 |
4 | 130020301300020120 |
5 | 443333234443000 |
6 | 21513524401520 |
7 | 2116453012014 |
oct | 341061601030 |
9 | 85875235203 |
10 | 30212031000 |
11 | 118a39a4068 |
12 | 5a31b462a0 |
13 | 2b062a2528 |
14 | 166867d544 |
15 | bbc55cd50 |
hex | 708c70218 |
30212031000 has 64 divisors (see below), whose sum is σ = 94261546080. Its totient is φ = 8056540800.
The previous prime is 30212030993. The next prime is 30212031001. The reversal of 30212031000 is 13021203.
It is a happy number.
It is a super-2 number, since 2×302120310002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30212031001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5032339 + ... + 5038338.
Almost surely, 230212031000 is an apocalyptic number.
30212031000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30212031000 is an abundant number, since it is smaller than the sum of its proper divisors (64049515080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30212031000 is a wasteful number, since it uses less digits than its factorization.
30212031000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10070701 (or 10070687 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 30212031000 its reverse (13021203), we get a palindrome (30225052203).
It can be divided in two parts, 3021203 and 1000, that added together give a palindrome (3022203).
The spelling of 30212031000 in words is "thirty billion, two hundred twelve million, thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •