Base | Representation |
---|---|
bin | 111101001011111100… |
… | …1010011100110001001 |
3 | 110120011022101120101021 |
4 | 1322113321103212021 |
5 | 4123100213312334 |
6 | 140210234152441 |
7 | 12331102323442 |
oct | 1722771234611 |
9 | 416138346337 |
10 | 131397400969 |
11 | 507a845316a |
12 | 21570882721 |
13 | c510553303 |
14 | 6506d022c9 |
15 | 36408933b4 |
hex | 1e97e53989 |
131397400969 has 8 divisors (see below), whose sum is σ = 136176860160. Its totient is φ = 126634509456.
The previous prime is 131397400963. The next prime is 131397400991. The reversal of 131397400969 is 969004793131.
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 131397400969 - 23 = 131397400961 is a prime.
It is a super-2 number, since 2×1313974009692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131397400961) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4125769 + ... + 4157494.
It is an arithmetic number, because the mean of its divisors is an integer number (17022107520).
Almost surely, 2131397400969 is an apocalyptic number.
It is an amenable number.
131397400969 is a deficient number, since it is larger than the sum of its proper divisors (4779459191).
131397400969 is an equidigital number, since it uses as much as digits as its factorization.
131397400969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8283839.
The product of its (nonzero) digits is 1102248, while the sum is 52.
The spelling of 131397400969 in words is "one hundred thirty-one billion, three hundred ninety-seven million, four hundred thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •