Base | Representation |
---|---|
bin | 10000011101101100110… |
… | …101101001101001100011 |
3 | 11000011100101020002112121 |
4 | 100131230311221221203 |
5 | 122014103003334103 |
6 | 2223431544005111 |
7 | 144512130513100 |
oct | 20355465515143 |
9 | 4004311202477 |
10 | 1131402402403 |
11 | 3a6909184779 |
12 | 163334460797 |
13 | 828c9880480 |
14 | 3ca8dc8baa7 |
15 | 1e66c7966bd |
hex | 1076cd69a63 |
1131402402403 has 12 divisors (see below), whose sum is σ = 1417361252160. Its totient is φ = 895175526672.
The previous prime is 1131402402401. The next prime is 1131402402413. The reversal of 1131402402403 is 3042042041311.
It is not a de Polignac number, because 1131402402403 - 21 = 1131402402401 is a prime.
It is a super-3 number, since 3×11314024024033 (a number of 37 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1131402402401) 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, 888070323 + ... + 888071596.
It is an arithmetic number, because the mean of its divisors is an integer number (118113437680).
Almost surely, 21131402402403 is an apocalyptic number.
1131402402403 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1131402402403 is a deficient number, since it is larger than the sum of its proper divisors (285958849757).
1131402402403 is a wasteful number, since it uses less digits than its factorization.
1131402402403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1776141946 (or 1776141939 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 1131402402403 its reverse (3042042041311), we get a palindrome (4173444443714).
The spelling of 1131402402403 in words is "one trillion, one hundred thirty-one billion, four hundred two million, four hundred two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •