Base | Representation |
---|---|
bin | 1101110010100001000000… |
… | …11010110010000001101001 |
3 | 10222100211222220122101021111 |
4 | 12321100200122302001221 |
5 | 12433303012312020241 |
6 | 144254111100510321 |
7 | 6246523346531065 |
oct | 671204032620151 |
9 | 128324886571244 |
10 | 30323013001321 |
11 | 9730a10357907 |
12 | 349897784b3a1 |
13 | 13bc5a8c2c9b1 |
14 | 76b8daa02aa5 |
15 | 378b879b4c81 |
hex | 1b94206b2069 |
30323013001321 has 8 divisors (see below), whose sum is σ = 30336182027424. Its totient is φ = 30309846120960.
The previous prime is 30323013001313. The next prime is 30323013001381. The reversal of 30323013001321 is 12310031032303.
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 30323013001321 - 23 = 30323013001313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30323013001292 and 30323013001301.
It is not an unprimeable number, because it can be changed into a prime (30323013001301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28063401 + ... + 29123881.
It is an arithmetic number, because the mean of its divisors is an integer number (3792022753428).
Almost surely, 230323013001321 is an apocalyptic number.
It is an amenable number.
30323013001321 is a deficient number, since it is larger than the sum of its proper divisors (13169026103).
30323013001321 is a wasteful number, since it uses less digits than its factorization.
30323013001321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1072871.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 30323013001321 its reverse (12310031032303), we get a palindrome (42633044033624).
The spelling of 30323013001321 in words is "thirty trillion, three hundred twenty-three billion, thirteen million, one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •