Base | Representation |
---|---|
bin | 10010111100101101101… |
… | …111001110011111011011 |
3 | 11121111001112201221222122 |
4 | 102330231233032133123 |
5 | 132313241431224111 |
6 | 2434110155411455 |
7 | 163035206110304 |
oct | 22745557163733 |
9 | 4544045657878 |
10 | 1302142445531 |
11 | 462265511234 |
12 | 190444a53b8b |
13 | 95a39c26ca5 |
14 | 47049d237ab |
15 | 23d12073cdb |
hex | 12f2dbce7db |
1302142445531 has 32 divisors (see below), whose sum is σ = 1460729168640. Its totient is φ = 1155041427456.
The previous prime is 1302142445507. The next prime is 1302142445543. The reversal of 1302142445531 is 1355442412031.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1302142445531 is a prime.
It is a super-2 number, since 2×13021424455312 (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 = 1302142445491 and 1302142445500.
It is not an unprimeable number, because it can be changed into a prime (1302142445231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3304430 + ... + 3677436.
It is an arithmetic number, because the mean of its divisors is an integer number (45647786520).
Almost surely, 21302142445531 is an apocalyptic number.
1302142445531 is a deficient number, since it is larger than the sum of its proper divisors (158586723109).
1302142445531 is a wasteful number, since it uses less digits than its factorization.
1302142445531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373223.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 1302142445531 its reverse (1355442412031), we get a palindrome (2657584857562).
The spelling of 1302142445531 in words is "one trillion, three hundred two billion, one hundred forty-two million, four hundred forty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •