Base | Representation |
---|---|
bin | 111101001100011100… |
… | …1011011011000000011 |
3 | 110120012111000120002212 |
4 | 1322120321123120003 |
5 | 4123114014210201 |
6 | 140212034332335 |
7 | 12331365232505 |
oct | 1723071333003 |
9 | 416174016085 |
10 | 131414210051 |
11 | 50806994073 |
12 | 2157642a0ab |
13 | c513b8a207 |
14 | 6509239d75 |
15 | 36420b3abb |
hex | 1e98e5b603 |
131414210051 has 8 divisors (see below), whose sum is σ = 132730472160. Its totient is φ = 130098724992.
The previous prime is 131414210029. The next prime is 131414210063. The reversal of 131414210051 is 150012414131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131414210051 - 210 = 131414209027 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131414209999 and 131414210026.
It is not an unprimeable number, because it can be changed into a prime (131414210071) by changing a digit.
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, 148685 + ... + 533793.
It is an arithmetic number, because the mean of its divisors is an integer number (16591309020).
Almost surely, 2131414210051 is an apocalyptic number.
131414210051 is a deficient number, since it is larger than the sum of its proper divisors (1316262109).
131414210051 is a wasteful number, since it uses less digits than its factorization.
131414210051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388525.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 131414210051 its reverse (150012414131), we get a palindrome (281426624182).
The spelling of 131414210051 in words is "one hundred thirty-one billion, four hundred fourteen million, two hundred ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •