Base | Representation |
---|---|
bin | 10111110111111110000101… |
… | …010111111010101001001001 |
3 | 111202210000201100111020112020 |
4 | 113313332011113322221021 |
5 | 102230320132044441203 |
6 | 1011152533245435053 |
7 | 31055044114240353 |
oct | 2767760527725111 |
9 | 452700640436466 |
10 | 105001303124553 |
11 | 30502891265480 |
12 | b939b57b6ba89 |
13 | 467877119a414 |
14 | 1bd01396900d3 |
15 | c214d15ec153 |
hex | 5f7f855faa49 |
105001303124553 has 16 divisors (see below), whose sum is σ = 152960225956032. Its totient is φ = 63540879336000.
The previous prime is 105001303124507. The next prime is 105001303124573. The reversal of 105001303124553 is 355421303100501.
It is not a de Polignac number, because 105001303124553 - 210 = 105001303123529 is a prime.
It is a super-2 number, since 2×1050013031245532 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (105001303124573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2406829678 + ... + 2406873303.
It is an arithmetic number, because the mean of its divisors is an integer number (9560014122252).
Almost surely, 2105001303124553 is an apocalyptic number.
It is an amenable number.
105001303124553 is a deficient number, since it is larger than the sum of its proper divisors (47958922831479).
105001303124553 is a wasteful number, since it uses less digits than its factorization.
105001303124553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4813703656.
The product of its (nonzero) digits is 27000, while the sum is 33.
The spelling of 105001303124553 in words is "one hundred five trillion, one billion, three hundred three million, one hundred twenty-four thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •