Base | Representation |
---|---|
bin | 110000111001100011… |
… | …1000000000010110101 |
3 | 101001001100122120021010 |
4 | 1201303013000002311 |
5 | 3210030132231013 |
6 | 120124025542433 |
7 | 10405153633350 |
oct | 1416307000265 |
9 | 331040576233 |
10 | 105010430133 |
11 | 40597717454 |
12 | 18427944a19 |
13 | 9b968808bb |
14 | 5122679297 |
15 | 2ae90517c3 |
hex | 18731c00b5 |
105010430133 has 16 divisors (see below), whose sum is σ = 160147849856. Its totient is φ = 59956476480.
The previous prime is 105010430081. The next prime is 105010430143. The reversal of 105010430133 is 331034010501.
It is not a de Polignac number, because 105010430133 - 29 = 105010429621 is a prime.
It is a super-2 number, since 2×1050104301332 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105010430143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2035738 + ... + 2086683.
It is an arithmetic number, because the mean of its divisors is an integer number (10009240616).
Almost surely, 2105010430133 is an apocalyptic number.
It is an amenable number.
105010430133 is a deficient number, since it is larger than the sum of its proper divisors (55137419723).
105010430133 is a wasteful number, since it uses less digits than its factorization.
105010430133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4123644.
The product of its (nonzero) digits is 540, while the sum is 21.
Adding to 105010430133 its reverse (331034010501), we get a palindrome (436044440634).
The spelling of 105010430133 in words is "one hundred five billion, ten million, four hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •