Base | Representation |
---|---|
bin | 11101110111000111111010… |
… | …001010110000100001110001 |
3 | 122020000011022220211111001101 |
4 | 131313013322022300201301 |
5 | 114203213213001242001 |
6 | 1143152452352404401 |
7 | 36443244552132562 |
oct | 3567077212604161 |
9 | 566004286744041 |
10 | 131331412134001 |
11 | 3893438038a642 |
12 | 12890aa8246701 |
13 | 5838664481161 |
14 | 246068d542169 |
15 | 102b371087a01 |
hex | 7771fa2b0871 |
131331412134001 has 16 divisors (see below), whose sum is σ = 139518415180800. Its totient is φ = 123196380802560.
The previous prime is 131331412133939. The next prime is 131331412134023. The reversal of 131331412134001 is 100431214133131.
It is a cyclic number.
It is not a de Polignac number, because 131331412134001 - 217 = 131331412002929 is a prime.
It is a super-2 number, since 2×1313314121340012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131331412134061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4442580 + ... + 16804741.
It is an arithmetic number, because the mean of its divisors is an integer number (8719900948800).
Almost surely, 2131331412134001 is an apocalyptic number.
It is an amenable number.
131331412134001 is a deficient number, since it is larger than the sum of its proper divisors (8187003046799).
131331412134001 is a wasteful number, since it uses less digits than its factorization.
131331412134001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21248544.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 131331412134001 its reverse (100431214133131), we get a palindrome (231762626267132).
The spelling of 131331412134001 in words is "one hundred thirty-one trillion, three hundred thirty-one billion, four hundred twelve million, one hundred thirty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.217 sec. • engine limits •