Base | Representation |
---|---|
bin | 110000111010111010… |
… | …1000010100010110111 |
3 | 101001011112111110122220 |
4 | 1201311311002202313 |
5 | 3210123322202211 |
6 | 120132335453423 |
7 | 10406246502030 |
oct | 1416565024267 |
9 | 331145443586 |
10 | 105056053431 |
11 | 4061044895a |
12 | 1843b087273 |
13 | 9ba3165b34 |
14 | 5128753a87 |
15 | 2aed064806 |
hex | 1875d428b7 |
105056053431 has 32 divisors (see below), whose sum is σ = 167069733888. Its totient is φ = 57413664000.
The previous prime is 105056053429. The next prime is 105056053439. The reversal of 105056053431 is 134350650501.
It is not a de Polignac number, because 105056053431 - 21 = 105056053429 is a prime.
It is a super-2 number, since 2×1050560534312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105056053392 and 105056053401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105056053439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4991931 + ... + 5012931.
It is an arithmetic number, because the mean of its divisors is an integer number (5220929184).
Almost surely, 2105056053431 is an apocalyptic number.
105056053431 is a deficient number, since it is larger than the sum of its proper divisors (62013680457).
105056053431 is a wasteful number, since it uses less digits than its factorization.
105056053431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31391.
The product of its (nonzero) digits is 27000, while the sum is 33.
The spelling of 105056053431 in words is "one hundred five billion, fifty-six million, fifty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •