Base | Representation |
---|---|
bin | 10010111011110110110… |
… | …001010011001111111111 |
3 | 11121101200021110012011021 |
4 | 102323312301103033333 |
5 | 132304344340224211 |
6 | 2433434453405011 |
7 | 163003310365444 |
oct | 22736661231777 |
9 | 4541607405137 |
10 | 1301220242431 |
11 | 4619319a440a |
12 | 190228039767 |
13 | 95920b58495 |
14 | 46d9d6679cb |
15 | 23cab10d771 |
hex | 12ef6c533ff |
1301220242431 has 16 divisors (see below), whose sum is σ = 1333151778816. Its totient is φ = 1269467369856.
The previous prime is 1301220242419. The next prime is 1301220242467. The reversal of 1301220242431 is 1342420221031.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1301220242431 is a prime.
It is a super-2 number, since 2×13012202424312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1301220242396 and 1301220242405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301220242131) 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, 112878790 + ... + 112890316.
It is an arithmetic number, because the mean of its divisors is an integer number (83321986176).
Almost surely, 21301220242431 is an apocalyptic number.
1301220242431 is a deficient number, since it is larger than the sum of its proper divisors (31931536385).
1301220242431 is a wasteful number, since it uses less digits than its factorization.
1301220242431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19038.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 1301220242431 its reverse (1342420221031), we get a palindrome (2643640463462).
The spelling of 1301220242431 in words is "one trillion, three hundred one billion, two hundred twenty million, two hundred forty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •