Base | Representation |
---|---|
bin | 111101001001010101… |
… | …1111010001101000100 |
3 | 110112221012221021220220 |
4 | 1322102223322031010 |
5 | 4122410330044022 |
6 | 140153433024340 |
7 | 12325661416056 |
oct | 1722253721504 |
9 | 415835837826 |
10 | 131310003012 |
11 | 50763089851 |
12 | 215475550b0 |
13 | c4c8402846 |
14 | 64d94718d6 |
15 | 3637d7c85c |
hex | 1e92afa344 |
131310003012 has 24 divisors (see below), whose sum is σ = 308446320000. Its totient is φ = 43476242016.
The previous prime is 131310002983. The next prime is 131310003047. The reversal of 131310003012 is 210300013131.
It is a super-2 number, since 2×1313100030122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131310002982 and 131310003000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36718012 + ... + 36721587.
It is an arithmetic number, because the mean of its divisors is an integer number (12851930000).
Almost surely, 2131310003012 is an apocalyptic number.
131310003012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131310003012 is an abundant number, since it is smaller than the sum of its proper divisors (177136316988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131310003012 is a wasteful number, since it uses less digits than its factorization.
131310003012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73439755 (or 73439753 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 131310003012 its reverse (210300013131), we get a palindrome (341610016143).
The spelling of 131310003012 in words is "one hundred thirty-one billion, three hundred ten million, three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •