Base | Representation |
---|---|
bin | 100011100111101101100001… |
… | …0101010110000011000000100 |
3 | 1112002101012121021122002222222 |
4 | 1013033123002222300120010 |
5 | 312031423133314400200 |
6 | 3030213423512111512 |
7 | 122665463456255042 |
oct | 10717330252603004 |
9 | 1462335537562888 |
10 | 313321130231300 |
11 | 90919821828a94 |
12 | 2b183898695598 |
13 | 105aa0957a0779 |
14 | 5752b76013392 |
15 | 2635305778d85 |
hex | 11cf6c2ab0604 |
313321130231300 has 72 divisors (see below), whose sum is σ = 698287541112000. Its totient is φ = 121940353584000.
The previous prime is 313321130231287. The next prime is 313321130231309. The reversal of 313321130231300 is 3132031123313.
It is a self number, because there is not a number n which added to its sum of digits gives 313321130231300.
It is not an unprimeable number, because it can be changed into a prime (313321130231309) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 965534075 + ... + 965858525.
It is an arithmetic number, because the mean of its divisors is an integer number (9698438071000).
Almost surely, 2313321130231300 is an apocalyptic number.
It is an amenable number.
313321130231300 is an abundant number, since it is smaller than the sum of its proper divisors (384966410880700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
313321130231300 is a wasteful number, since it uses less digits than its factorization.
313321130231300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 585501 (or 585494 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 313321130231300 its reverse (3132031123313), we get a palindrome (316453161354613).
The spelling of 313321130231300 in words is "three hundred thirteen trillion, three hundred twenty-one billion, one hundred thirty million, two hundred thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •