Base | Representation |
---|---|
bin | 11100001001110110… |
… | …110000011110000011 |
3 | 2220000210022020010001 |
4 | 130021312300132003 |
5 | 443402402322243 |
6 | 21515412220431 |
7 | 2120062532404 |
oct | 341166603603 |
9 | 86023266101 |
10 | 30230120323 |
11 | 11903129917 |
12 | 5a3800a717 |
13 | 2b09c67080 |
14 | 166ac2b9ab |
15 | bbde32a4d |
hex | 709db0783 |
30230120323 has 32 divisors (see below), whose sum is σ = 34304679360. Its totient is φ = 26453122560.
The previous prime is 30230120317. The next prime is 30230120351. The reversal of 30230120323 is 32302103203.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30230120323 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30230120323.
It is not an unprimeable number, because it can be changed into a prime (30230120383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3134673 + ... + 3144301.
It is an arithmetic number, because the mean of its divisors is an integer number (1072021230).
Almost surely, 230230120323 is an apocalyptic number.
30230120323 is a deficient number, since it is larger than the sum of its proper divisors (4074559037).
30230120323 is a wasteful number, since it uses less digits than its factorization.
30230120323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9847.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 30230120323 its reverse (32302103203), we get a palindrome (62532223526).
It can be divided in two parts, 302301 and 20323, that added together give a square (322624 = 5682).
The spelling of 30230120323 in words is "thirty billion, two hundred thirty million, one hundred twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •