Base | Representation |
---|---|
bin | 11100011101001110… |
… | …001110001001011011 |
3 | 2220212102200202210011 |
4 | 130131032032021123 |
5 | 1000034042211144 |
6 | 22011540302351 |
7 | 2131116353212 |
oct | 343516161133 |
9 | 86772622704 |
10 | 30555038299 |
11 | 11a5a582575 |
12 | 5b089a19b7 |
13 | 2b5c37a926 |
14 | 169c04a079 |
15 | bdc714a34 |
hex | 71d38e25b |
30555038299 has 4 divisors (see below), whose sum is σ = 30555603864. Its totient is φ = 30554472736.
The previous prime is 30555038291. The next prime is 30555038333. The reversal of 30555038299 is 99283055503.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30555038299 - 23 = 30555038291 is a prime.
It is a super-2 number, since 2×305550382992 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30555038291) 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, 192037 + ... + 313030.
It is an arithmetic number, because the mean of its divisors is an integer number (7638900966).
Almost surely, 230555038299 is an apocalyptic number.
30555038299 is a deficient number, since it is larger than the sum of its proper divisors (565565).
30555038299 is an equidigital number, since it uses as much as digits as its factorization.
30555038299 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565564.
The product of its (nonzero) digits is 1458000, while the sum is 49.
The spelling of 30555038299 in words is "thirty billion, five hundred fifty-five million, thirty-eight thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •