Base | Representation |
---|---|
bin | 111001011101… |
… | …1111101010010 |
3 | 2002200202121000 |
4 | 1302323331102 |
5 | 30203130002 |
6 | 2553442430 |
7 | 514046400 |
oct | 162737522 |
9 | 62622530 |
10 | 30130002 |
11 | 1600a131 |
12 | a110416 |
13 | 631c206 |
14 | 4004470 |
15 | 29a261c |
hex | 1cbbf52 |
30130002 has 96 divisors (see below), whose sum is σ = 79617600. Its totient is φ = 8418816.
The previous prime is 30129997. The next prime is 30130003. The reversal of 30130002 is 20003103.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30130003) 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, 156018 + ... + 156210.
It is an arithmetic number, because the mean of its divisors is an integer number (829350).
Almost surely, 230130002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30130002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39808800).
30130002 is an abundant number, since it is smaller than the sum of its proper divisors (49487598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30130002 is a wasteful number, since it uses less digits than its factorization.
30130002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277 (or 264 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 9.
The square root of 30130002 is about 5489.0802508253. The cubic root of 30130002 is about 311.1714332107.
Adding to 30130002 its reverse (20003103), we get a palindrome (50133105).
It can be divided in two parts, 301 and 30002, that added together give a palindrome (30303).
The spelling of 30130002 in words is "thirty million, one hundred thirty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •