Base | Representation |
---|---|
bin | 11101111000001010100110… |
… | …011000111111101100001100 |
3 | 122020021000011110121000002220 |
4 | 131320022212120333230030 |
5 | 114210401341340232022 |
6 | 1143245414155415340 |
7 | 36451361233506633 |
oct | 3570124630775414 |
9 | 566230143530086 |
10 | 131403021024012 |
11 | 38961787775581 |
12 | 128a2951a54550 |
13 | 5842337024b1a |
14 | 2463d23ac451a |
15 | 102d162a5185c |
hex | 7782a663fb0c |
131403021024012 has 48 divisors (see below), whose sum is σ = 322745509954560. Its totient is φ = 41495530419648.
The previous prime is 131403021024007. The next prime is 131403021024047. The reversal of 131403021024012 is 210420120304131.
It is a super-2 number, since 2×1314030210240122 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67137253 + ... + 69066755.
It is an arithmetic number, because the mean of its divisors is an integer number (6723864790720).
Almost surely, 2131403021024012 is an apocalyptic number.
131403021024012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131403021024012 is an abundant number, since it is smaller than the sum of its proper divisors (191342488930548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131403021024012 is a wasteful number, since it uses less digits than its factorization.
131403021024012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2228222 (or 2228220 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 131403021024012 its reverse (210420120304131), we get a palindrome (341823141328143).
The spelling of 131403021024012 in words is "one hundred thirty-one trillion, four hundred three billion, twenty-one million, twenty-four thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •