Base | Representation |
---|---|
bin | 111010100011… |
… | …0100101010100 |
3 | 2010202121111000 |
4 | 1311012211110 |
5 | 30324312222 |
6 | 3013543300 |
7 | 521632665 |
oct | 165064524 |
9 | 63677430 |
10 | 30697812 |
11 | 163677a2 |
12 | a344b30 |
13 | 648a7b2 |
14 | 411136c |
15 | 2a659ac |
hex | 1d46954 |
30697812 has 96 divisors (see below), whose sum is σ = 84188160. Its totient is φ = 9659520.
The previous prime is 30697789. The next prime is 30697813. The reversal of 30697812 is 21879603.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30697813) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 177358 + ... + 177530.
It is an arithmetic number, because the mean of its divisors is an integer number (876960).
Almost surely, 230697812 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 30697812, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42094080).
30697812 is an abundant number, since it is smaller than the sum of its proper divisors (53490348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30697812 is a wasteful number, since it uses less digits than its factorization.
30697812 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 270 (or 262 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 30697812 is about 5540.5606214534. The cubic root of 30697812 is about 313.1139911508.
The spelling of 30697812 in words is "thirty million, six hundred ninety-seven thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •