Base | Representation |
---|---|
bin | 10100010011100111… |
… | …10011001011000011 |
3 | 1001010210000120201100 |
4 | 22021303303023003 |
5 | 134311402222011 |
6 | 5001443305443 |
7 | 534106255422 |
oct | 121163631303 |
9 | 31123016640 |
10 | 10901992131 |
11 | 4694988058 |
12 | 214307b283 |
13 | 1049830824 |
14 | 755c7b2b9 |
15 | 43c17ed56 |
hex | 289cf32c3 |
10901992131 has 12 divisors (see below), whose sum is σ = 15751817640. Its totient is φ = 7265919840.
The previous prime is 10901992117. The next prime is 10901992141. The reversal of 10901992131 is 13129910901.
10901992131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10901992131 - 227 = 10767774403 is a prime.
It is a super-2 number, since 2×109019921312 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10901992141) 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 11 ways as a sum of consecutive naturals, for example, 139290 + ... + 202991.
It is an arithmetic number, because the mean of its divisors is an integer number (1312651470).
Almost surely, 210901992131 is an apocalyptic number.
10901992131 is a deficient number, since it is larger than the sum of its proper divisors (4849825509).
10901992131 is a wasteful number, since it uses less digits than its factorization.
10901992131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345826 (or 345823 counting only the distinct ones).
The product of its (nonzero) digits is 4374, while the sum is 36.
The spelling of 10901992131 in words is "ten billion, nine hundred one million, nine hundred ninety-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •