Base | Representation |
---|---|
bin | 1101110010100001011000… |
… | …10011001011000001000011 |
3 | 10222100212111210201111002211 |
4 | 12321100230103023001003 |
5 | 12433303414324124443 |
6 | 144254142541122551 |
7 | 6246531320033263 |
oct | 671205423130103 |
9 | 128325453644084 |
10 | 30323212333123 |
11 | 9731002923836 |
12 | 3498a12559457 |
13 | 13bc60b311ac8 |
14 | 76b91928d7a3 |
15 | 378b9a23b19d |
hex | 1b942c4cb043 |
30323212333123 has 8 divisors (see below), whose sum is σ = 31369031804880. Its totient is φ = 29277405625440.
The previous prime is 30323212333109. The next prime is 30323212333157. The reversal of 30323212333123 is 32133321232303.
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 30323212333123 - 221 = 30323210235971 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30323212333223) 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 7 ways as a sum of consecutive naturals, for example, 1773168 + ... + 7986898.
It is an arithmetic number, because the mean of its divisors is an integer number (3921128975610).
Almost surely, 230323212333123 is an apocalyptic number.
30323212333123 is a deficient number, since it is larger than the sum of its proper divisors (1045819471757).
30323212333123 is a wasteful number, since it uses less digits than its factorization.
30323212333123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6382037.
The product of its (nonzero) digits is 34992, while the sum is 31.
Adding to 30323212333123 its reverse (32133321232303), we get a palindrome (62456533565426).
The spelling of 30323212333123 in words is "thirty trillion, three hundred twenty-three billion, two hundred twelve million, three hundred thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •