Base | Representation |
---|---|
bin | 1101110010100001000000… |
… | …11010110010000001100001 |
3 | 10222100211222220122101021012 |
4 | 12321100200122302001201 |
5 | 12433303012312020223 |
6 | 144254111100510305 |
7 | 6246523346531054 |
oct | 671204032620141 |
9 | 128324886571235 |
10 | 30323013001313 |
11 | 9730a103578aa |
12 | 349897784b395 |
13 | 13bc5a8c2c9a6 |
14 | 76b8daa02a9b |
15 | 378b879b4c78 |
hex | 1b94206b2061 |
30323013001313 has 2 divisors, whose sum is σ = 30323013001314. Its totient is φ = 30323013001312.
The previous prime is 30323013001301. The next prime is 30323013001381. The reversal of 30323013001313 is 31310031032303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29783738672704 + 539274328609 = 5457448^2 + 734353^2 .
It is a cyclic number.
It is not a de Polignac number, because 30323013001313 - 222 = 30323008807009 is a prime.
It is not a weakly prime, because it can be changed into another prime (30323013001013) 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 as a sum of consecutive naturals, namely, 15161506500656 + 15161506500657.
It is an arithmetic number, because the mean of its divisors is an integer number (15161506500657).
Almost surely, 230323013001313 is an apocalyptic number.
It is an amenable number.
30323013001313 is a deficient number, since it is larger than the sum of its proper divisors (1).
30323013001313 is an equidigital number, since it uses as much as digits as its factorization.
30323013001313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 30323013001313 its reverse (31310031032303), we get a palindrome (61633044033616).
The spelling of 30323013001313 in words is "thirty trillion, three hundred twenty-three billion, thirteen million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •