Base | Representation |
---|---|
bin | 10100010011100000… |
… | …01110011111000111 |
3 | 1001010201020222210202 |
4 | 22021300032133013 |
5 | 134311132233211 |
6 | 5001411241115 |
7 | 534065304500 |
oct | 121160163707 |
9 | 31121228722 |
10 | 10901055431 |
11 | 46943a8322 |
12 | 21428a919b |
13 | 1049593376 |
14 | 755ab5ba7 |
15 | 43c04753b |
hex | 289c0e7c7 |
10901055431 has 24 divisors (see below), whose sum is σ = 12988982160. Its totient is φ = 9117142272.
The previous prime is 10901055349. The next prime is 10901055437. The reversal of 10901055431 is 13455010901.
10901055431 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 10901055431 - 210 = 10901054407 is a prime.
It is a super-2 number, since 2×109010554312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10901055394 and 10901055403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10901055437) 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 23 ways as a sum of consecutive naturals, for example, 2730785 + ... + 2734773.
It is an arithmetic number, because the mean of its divisors is an integer number (541207590).
Almost surely, 210901055431 is an apocalyptic number.
10901055431 is a deficient number, since it is larger than the sum of its proper divisors (2087926729).
10901055431 is a wasteful number, since it uses less digits than its factorization.
10901055431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5343 (or 5336 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 29.
The spelling of 10901055431 in words is "ten billion, nine hundred one million, fifty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •