Base | Representation |
---|---|
bin | 111101010000001010… |
… | …1000111101000000010 |
3 | 110120112011122221212022 |
4 | 1322200111013220002 |
5 | 4123342430102243 |
6 | 140232251201442 |
7 | 12334441166360 |
oct | 1724025075002 |
9 | 416464587768 |
10 | 131538909698 |
11 | 50870315829 |
12 | 215b0146282 |
13 | c53396b2a1 |
14 | 651ba1a630 |
15 | 364cee6b68 |
hex | 1ea0547a02 |
131538909698 has 16 divisors (see below), whose sum is σ = 227819969664. Its totient is φ = 55792644480.
The previous prime is 131538909643. The next prime is 131538909707. The reversal of 131538909698 is 896909835131.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 131538909698.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48429758 + ... + 48432473.
It is an arithmetic number, because the mean of its divisors is an integer number (14238748104).
Almost surely, 2131538909698 is an apocalyptic number.
131538909698 is a deficient number, since it is larger than the sum of its proper divisors (96281059966).
131538909698 is an equidigital number, since it uses as much as digits as its factorization.
131538909698 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96862337.
The product of its (nonzero) digits is 12597120, while the sum is 62.
The spelling of 131538909698 in words is "one hundred thirty-one billion, five hundred thirty-eight million, nine hundred nine thousand, six hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •