Base | Representation |
---|---|
bin | 1001001101101101010101… |
… | …1001011111100101101111 |
3 | 1022212112011200200112202102 |
4 | 2103123111121133211233 |
5 | 2311442004424121332 |
6 | 33314100310045315 |
7 | 2063643266414006 |
oct | 223332531374557 |
9 | 38775150615672 |
10 | 10131113113967 |
11 | 325664326514a |
12 | 117758934983b |
13 | 58648a822a71 |
14 | 2704c438bc3d |
15 | 12880087d062 |
hex | 936d565f96f |
10131113113967 has 2 divisors, whose sum is σ = 10131113113968. Its totient is φ = 10131113113966.
The previous prime is 10131113113963. The next prime is 10131113114041. The reversal of 10131113113967 is 76931131113101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10131113113967 - 22 = 10131113113963 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10131113113967.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10131113113963) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065556556983 + 5065556556984.
It is an arithmetic number, because the mean of its divisors is an integer number (5065556556984).
Almost surely, 210131113113967 is an apocalyptic number.
10131113113967 is a deficient number, since it is larger than the sum of its proper divisors (1).
10131113113967 is an equidigital number, since it uses as much as digits as its factorization.
10131113113967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10206, while the sum is 38.
The spelling of 10131113113967 in words is "ten trillion, one hundred thirty-one billion, one hundred thirteen million, one hundred thirteen thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •