Base | Representation |
---|---|
bin | 100011100101011000100000… |
… | …1110010100000001001010011 |
3 | 1112001020121122122100111220221 |
4 | 1013022301001302200021103 |
5 | 312011202313421434303 |
6 | 3025410423332013511 |
7 | 122633405021615563 |
oct | 10712610162401123 |
9 | 1461217578314827 |
10 | 313001140421203 |
11 | 90806046932583 |
12 | 2b131874761297 |
13 | 10585b5b424380 |
14 | 574149c0bcda3 |
15 | 262bd281b34bd |
hex | 11cac41ca0253 |
313001140421203 has 8 divisors (see below), whose sum is σ = 337079187824288. Its totient is φ = 288923241104064.
The previous prime is 313001140421183. The next prime is 313001140421209. The reversal of 313001140421203 is 302124041100313.
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 313001140421203 - 29 = 313001140420691 is a prime.
It is not an unprimeable number, because it can be changed into a prime (313001140421209) 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, 32612151 + ... + 41104192.
It is an arithmetic number, because the mean of its divisors is an integer number (42134898478036).
Almost surely, 2313001140421203 is an apocalyptic number.
313001140421203 is a deficient number, since it is larger than the sum of its proper divisors (24078047403085).
313001140421203 is a wasteful number, since it uses less digits than its factorization.
313001140421203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74042973.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 313001140421203 its reverse (302124041100313), we get a palindrome (615125181521516).
The spelling of 313001140421203 in words is "three hundred thirteen trillion, one billion, one hundred forty million, four hundred twenty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •