Base | Representation |
---|---|
bin | 1101101001011010100010… |
… | …10010100000101101011111 |
3 | 10221020221211102112102120010 |
4 | 12310231101102200231133 |
5 | 12413142043334213343 |
6 | 143454312554254303 |
7 | 6215113134465531 |
oct | 664552122405537 |
9 | 127227742472503 |
10 | 30010300304223 |
11 | 962032a178078 |
12 | 3448244a27393 |
13 | 1398c61402b15 |
14 | 75a713361851 |
15 | 370984205d33 |
hex | 1b4b514a0b5f |
30010300304223 has 16 divisors (see below), whose sum is σ = 41778568765440. Its totient is φ = 19125495501024.
The previous prime is 30010300304221. The next prime is 30010300304227. The reversal of 30010300304223 is 32240300301003.
It is not a de Polignac number, because 30010300304223 - 21 = 30010300304221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30010300304223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30010300304221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 130652508 + ... + 130882001.
It is an arithmetic number, because the mean of its divisors is an integer number (2611160547840).
Almost surely, 230010300304223 is an apocalyptic number.
30010300304223 is a deficient number, since it is larger than the sum of its proper divisors (11768268461217).
30010300304223 is a wasteful number, since it uses less digits than its factorization.
30010300304223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261536198.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 30010300304223 its reverse (32240300301003), we get a palindrome (62250600605226).
The spelling of 30010300304223 in words is "thirty trillion, ten billion, three hundred million, three hundred four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •