Base | Representation |
---|---|
bin | 110001000101100011… |
… | …0101100111011101001 |
3 | 101002002102011111012121 |
4 | 1202023012230323221 |
5 | 3211341212130113 |
6 | 120232010311241 |
7 | 10421142521200 |
oct | 1421306547351 |
9 | 332072144177 |
10 | 105413005033 |
11 | 40783990986 |
12 | 1851a728521 |
13 | 9c2c0b41bb |
14 | 515dd10237 |
15 | 2b1e572e8d |
hex | 188b1acee9 |
105413005033 has 24 divisors (see below), whose sum is σ = 124040839104. Its totient is φ = 89315503200.
The previous prime is 105413004973. The next prime is 105413005039. The reversal of 105413005033 is 330500314501.
It is not a de Polignac number, because 105413005033 - 213 = 105412996841 is a prime.
It is a super-2 number, since 2×1054130050332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105413004989 and 105413005007.
It is not an unprimeable number, because it can be changed into a prime (105413005039) 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 23 ways as a sum of consecutive naturals, for example, 1445538 + ... + 1516708.
It is an arithmetic number, because the mean of its divisors is an integer number (5168368296).
Almost surely, 2105413005033 is an apocalyptic number.
It is an amenable number.
105413005033 is a deficient number, since it is larger than the sum of its proper divisors (18627834071).
105413005033 is a wasteful number, since it uses less digits than its factorization.
105413005033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71533 (or 71526 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 25.
Adding to 105413005033 its reverse (330500314501), we get a palindrome (435913319534).
The spelling of 105413005033 in words is "one hundred five billion, four hundred thirteen million, five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •