Base | Representation |
---|---|
bin | 11101111000100110110011… |
… | …011010001001001100111111 |
3 | 122020100220022221201201220112 |
4 | 131320212303122021030333 |
5 | 114211400401333344444 |
6 | 1143311343145140235 |
7 | 36453512542324514 |
oct | 3570466332111477 |
9 | 566326287651815 |
10 | 131433304199999 |
11 | 3897360784194a |
12 | 128a87a378a67b |
13 | 5845151c77079 |
14 | 24655979a330b |
15 | 102dd3646469e |
hex | 7789b368933f |
131433304199999 has 2 divisors, whose sum is σ = 131433304200000. Its totient is φ = 131433304199998.
The previous prime is 131433304199983. The next prime is 131433304200001. The reversal of 131433304199999 is 999991403334131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131433304199999 - 24 = 131433304199983 is a prime.
Together with 131433304200001, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131433304190999) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65716652099999 + 65716652100000.
It is an arithmetic number, because the mean of its divisors is an integer number (65716652100000).
Almost surely, 2131433304199999 is an apocalyptic number.
131433304199999 is a deficient number, since it is larger than the sum of its proper divisors (1).
131433304199999 is an equidigital number, since it uses as much as digits as its factorization.
131433304199999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 76527504, while the sum is 68.
The spelling of 131433304199999 in words is "one hundred thirty-one trillion, four hundred thirty-three billion, three hundred four million, one hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •