Base | Representation |
---|---|
bin | 11010000011111111… |
… | …01110100111010011 |
3 | 1100010010122200202101 |
4 | 31001333232213103 |
5 | 212123441030211 |
6 | 10232231501231 |
7 | 1003511054656 |
oct | 150177564723 |
9 | 40103580671 |
10 | 13992126931 |
11 | 5a30211072 |
12 | 2865b27817 |
13 | 141cab3463 |
14 | 96a42789d |
15 | 56d5ca5c1 |
hex | 341fee9d3 |
13992126931 has 8 divisors (see below), whose sum is σ = 14071017104. Its totient is φ = 13913303040.
The previous prime is 13992126893. The next prime is 13992126961. The reversal of 13992126931 is 13962129931.
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 13992126931 - 29 = 13992126419 is a prime.
It is a super-2 number, since 2×139921269312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13992126961) 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, 442315 + ... + 472891.
It is an arithmetic number, because the mean of its divisors is an integer number (1758877138).
Almost surely, 213992126931 is an apocalyptic number.
13992126931 is a deficient number, since it is larger than the sum of its proper divisors (78890173).
13992126931 is a wasteful number, since it uses less digits than its factorization.
13992126931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33141.
The product of its digits is 157464, while the sum is 46.
The spelling of 13992126931 in words is "thirteen billion, nine hundred ninety-two million, one hundred twenty-six thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •