Base | Representation |
---|---|
bin | 11100001111010101… |
… | …101000100001100011 |
3 | 2220021012101021221201 |
4 | 130033111220201203 |
5 | 444044424202243 |
6 | 21532455502031 |
7 | 2122260412564 |
oct | 341725504143 |
9 | 86235337851 |
10 | 30322100323 |
11 | 11950042849 |
12 | 5a62987917 |
13 | 2b230302c8 |
14 | 167913216b |
15 | bc705104d |
hex | 70f568863 |
30322100323 has 8 divisors (see below), whose sum is σ = 32200462800. Its totient is φ = 28471984128.
The previous prime is 30322100309. The next prime is 30322100351. The reversal of 30322100323 is 32300122303.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30322100323 - 29 = 30322099811 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 30322100323.
It is not an unprimeable number, because it can be changed into a prime (30322100423) 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 7 ways as a sum of consecutive naturals, for example, 7059358 + ... + 7063651.
It is an arithmetic number, because the mean of its divisors is an integer number (4025057850).
Almost surely, 230322100323 is an apocalyptic number.
30322100323 is a deficient number, since it is larger than the sum of its proper divisors (1878362477).
30322100323 is a wasteful number, since it uses less digits than its factorization.
30322100323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14123141.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 30322100323 its reverse (32300122303), we get a palindrome (62622222626).
The spelling of 30322100323 in words is "thirty billion, three hundred twenty-two million, one hundred thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •