Base | Representation |
---|---|
bin | 10010101011101010… |
… | …11101101001100110 |
3 | 221220000020110021002 |
4 | 21111311131221212 |
5 | 131020140404110 |
6 | 4335133553302 |
7 | 503360463332 |
oct | 112565355146 |
9 | 27800213232 |
10 | 10030013030 |
11 | 4287754274 |
12 | 1b3b045832 |
13 | c3ac9836b |
14 | 6b21367c2 |
15 | 3da83aaa5 |
hex | 255d5da66 |
10030013030 has 8 divisors (see below), whose sum is σ = 18054023472. Its totient is φ = 4012005208.
The previous prime is 10030013027. The next prime is 10030013033. The reversal of 10030013030 is 3031003001.
It is an interprime number because it is at equal distance from previous prime (10030013027) and next prime (10030013033).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×100300130302 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10030013033) 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 3 ways as a sum of consecutive naturals, for example, 501500642 + ... + 501500661.
It is an arithmetic number, because the mean of its divisors is an integer number (2256752934).
Almost surely, 210030013030 is an apocalyptic number.
10030013030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10030013030 is a deficient number, since it is larger than the sum of its proper divisors (8024010442).
10030013030 is a wasteful number, since it uses less digits than its factorization.
10030013030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1003001310.
The product of its (nonzero) digits is 27, while the sum is 11.
Adding to 10030013030 its reverse (3031003001), we get a palindrome (13061016031).
The spelling of 10030013030 in words is "ten billion, thirty million, thirteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •