Base | Representation |
---|---|
bin | 10010111011111100001… |
… | …000001000100110101100 |
3 | 11121101220112120011002001 |
4 | 102323330020020212230 |
5 | 132310040342123340 |
6 | 2433451423542044 |
7 | 163005451315354 |
oct | 22737410104654 |
9 | 4541815504061 |
10 | 1301310114220 |
11 | 4619786a8416 |
12 | 19025215a924 |
13 | 95936663c5c |
14 | 46dab57db64 |
15 | 23cb3e6229a |
hex | 12efc2089ac |
1301310114220 has 24 divisors (see below), whose sum is σ = 2820904507008. Its totient is φ = 503732947200.
The previous prime is 1301310114163. The next prime is 1301310114227. The reversal of 1301310114220 is 224110131031.
It is not an unprimeable number, because it can be changed into a prime (1301310114227) 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, 1049443021 + ... + 1049444260.
It is an arithmetic number, because the mean of its divisors is an integer number (117537687792).
Almost surely, 21301310114220 is an apocalyptic number.
1301310114220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1301310114220 is an abundant number, since it is smaller than the sum of its proper divisors (1519594392788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301310114220 is a wasteful number, since it uses less digits than its factorization.
1301310114220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2098887321 (or 2098887319 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1301310114220 its reverse (224110131031), we get a palindrome (1525420245251).
The spelling of 1301310114220 in words is "one trillion, three hundred one billion, three hundred ten million, one hundred fourteen thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •