Base | Representation |
---|---|
bin | 10010111001000001… |
… | …01010001101011111 |
3 | 222011210221222110102 |
4 | 21130200222031133 |
5 | 131232322444332 |
6 | 4354214131315 |
7 | 506220402011 |
oct | 113440521537 |
9 | 28153858412 |
10 | 10141999967 |
11 | 4334992760 |
12 | 1b70650b3b |
13 | c58247c18 |
14 | 6c2d681b1 |
15 | 3e55ac062 |
hex | 25c82a35f |
10141999967 has 4 divisors (see below), whose sum is σ = 11063999976. Its totient is φ = 9219999960.
The previous prime is 10141999963. The next prime is 10141999979. The reversal of 10141999967 is 76999914101.
10141999967 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10141999967 - 22 = 10141999963 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10141999963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 460999988 + ... + 461000009.
It is an arithmetic number, because the mean of its divisors is an integer number (2765999994).
Almost surely, 210141999967 is an apocalyptic number.
10141999967 is a deficient number, since it is larger than the sum of its proper divisors (922000009).
10141999967 is an equidigital number, since it uses as much as digits as its factorization.
10141999967 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 922000008.
The product of its (nonzero) digits is 1102248, while the sum is 56.
The spelling of 10141999967 in words is "ten billion, one hundred forty-one million, nine hundred ninety-nine thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •