Base | Representation |
---|---|
bin | 11101111000001011100010… |
… | …001011000011010111011100 |
3 | 122020021002202100212120021020 |
4 | 131320023202023003113130 |
5 | 114210410420121031022 |
6 | 1143250101505004140 |
7 | 36451425132623016 |
oct | 3570134213032734 |
9 | 566232670776236 |
10 | 131404024002012 |
11 | 38962151942813 |
12 | 128a2b91923650 |
13 | 5842466a65628 |
14 | 2463dbada91b6 |
15 | 102d1c0b2035c |
hex | 7782e22c35dc |
131404024002012 has 12 divisors (see below), whose sum is σ = 306609389338056. Its totient is φ = 43801341334000.
The previous prime is 131404024001983. The next prime is 131404024002023. The reversal of 131404024002012 is 210200420404131.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5475167666739 + ... + 5475167666762.
It is an arithmetic number, because the mean of its divisors is an integer number (25550782444838).
Almost surely, 2131404024002012 is an apocalyptic number.
131404024002012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131404024002012 is an abundant number, since it is smaller than the sum of its proper divisors (175205365336044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131404024002012 is a wasteful number, since it uses less digits than its factorization.
131404024002012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10950335333508 (or 10950335333506 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 131404024002012 its reverse (210200420404131), we get a palindrome (341604444406143).
The spelling of 131404024002012 in words is "one hundred thirty-one trillion, four hundred four billion, twenty-four million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •