Base | Representation |
---|---|
bin | 10000011101010101101… |
… | …001011000011101011110 |
3 | 11000010100021002011112001 |
4 | 100131111221120131132 |
5 | 122012303401412202 |
6 | 2223325204232514 |
7 | 144466364341561 |
oct | 20352551303536 |
9 | 4003307064461 |
10 | 1131013310302 |
11 | 3a672958a057 |
12 | 16324609b73a |
13 | 8286708aa65 |
14 | 3ca543264d8 |
15 | 1e648539d87 |
hex | 10755a5875e |
1131013310302 has 4 divisors (see below), whose sum is σ = 1696519965456. Its totient is φ = 565506655150.
The previous prime is 1131013310281. The next prime is 1131013310303. The reversal of 1131013310302 is 2030133101311.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×11310133103022 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1131013310302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131013310303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 282753327574 + ... + 282753327577.
It is an arithmetic number, because the mean of its divisors is an integer number (424129991364).
Almost surely, 21131013310302 is an apocalyptic number.
1131013310302 is a deficient number, since it is larger than the sum of its proper divisors (565506655154).
1131013310302 is an equidigital number, since it uses as much as digits as its factorization.
1131013310302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565506655153.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1131013310302 its reverse (2030133101311), we get a palindrome (3161146411613).
The spelling of 1131013310302 in words is "one trillion, one hundred thirty-one billion, thirteen million, three hundred ten thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •