Base | Representation |
---|---|
bin | 100011100110001111111011… |
… | …0001000100100000010111101 |
3 | 1112001122222210020122121012012 |
4 | 1013030133312020210002331 |
5 | 312020130011314021341 |
6 | 3025541222500221005 |
7 | 122645116503332612 |
oct | 10714376610440275 |
9 | 1461588706577165 |
10 | 313120130220221 |
11 | 90851557536755 |
12 | 2b15094209a765 |
13 | 1059414223c37c |
14 | 57471491c0509 |
15 | 262ee8e6200eb |
hex | 11cc7f62240bd |
313120130220221 has 16 divisors (see below), whose sum is σ = 326877282271488. Its totient is φ = 299374928899200.
The previous prime is 313120130220203. The next prime is 313120130220229. The reversal of 313120130220221 is 122022031021313.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-313120130220221 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313120130220229) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 999202241 + ... + 999515561.
It is an arithmetic number, because the mean of its divisors is an integer number (20429830141968).
Almost surely, 2313120130220221 is an apocalyptic number.
It is an amenable number.
313120130220221 is a deficient number, since it is larger than the sum of its proper divisors (13757152051267).
313120130220221 is a wasteful number, since it uses less digits than its factorization.
313120130220221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 332252.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 313120130220221 its reverse (122022031021313), we get a palindrome (435142161241534).
The spelling of 313120130220221 in words is "three hundred thirteen trillion, one hundred twenty billion, one hundred thirty million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •