Base | Representation |
---|---|
bin | 10010111011110000011… |
… | …101100010110100010101 |
3 | 11121101101220021211200000 |
4 | 102323300131202310111 |
5 | 132304140241300041 |
6 | 2433420153041513 |
7 | 163000553631132 |
oct | 22736035426425 |
9 | 4541356254600 |
10 | 1301114400021 |
11 | 461888182447 |
12 | 1901b86b6299 |
13 | 95904c4a637 |
14 | 46d8d595589 |
15 | 23ca1ba2bb6 |
hex | 12ef0762d15 |
1301114400021 has 12 divisors (see below), whose sum is σ = 1948994410272. Its totient is φ = 867409599852.
The previous prime is 1301114400013. The next prime is 1301114400041. The reversal of 1301114400021 is 1200044111031.
1301114400021 is a `hidden beast` number, since 130 + 1 + 114 + 400 + 0 + 21 = 666.
It is not a de Polignac number, because 1301114400021 - 23 = 1301114400013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1301114399967 and 1301114400003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301114400041) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2677189881 + ... + 2677190366.
It is an arithmetic number, because the mean of its divisors is an integer number (162416200856).
Almost surely, 21301114400021 is an apocalyptic number.
It is an amenable number.
1301114400021 is a deficient number, since it is larger than the sum of its proper divisors (647880010251).
1301114400021 is an frugal number, since it uses more digits than its factorization.
1301114400021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5354380262 (or 5354380250 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1301114400021 its reverse (1200044111031), we get a palindrome (2501158511052).
The spelling of 1301114400021 in words is "one trillion, three hundred one billion, one hundred fourteen million, four hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •