Base | Representation |
---|---|
bin | 110000111010100010… |
… | …0011110111000001010 |
3 | 101001010122112202202021 |
4 | 1201311010132320022 |
5 | 3210112042340201 |
6 | 120131202555054 |
7 | 10406033345155 |
oct | 1416504367012 |
9 | 331118482667 |
10 | 105043324426 |
11 | 40604244417 |
12 | 18436968a8a |
13 | 9ba062a091 |
14 | 5126b9cc9c |
15 | 2aebd9cea1 |
hex | 187511ee0a |
105043324426 has 32 divisors (see below), whose sum is σ = 166461402240. Its totient is φ = 49613492544.
The previous prime is 105043324369. The next prime is 105043324427. The reversal of 105043324426 is 624423340501.
105043324426 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1050433244262 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105043324391 and 105043324400.
It is not an unprimeable number, because it can be changed into a prime (105043324427) 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 15 ways as a sum of consecutive naturals, for example, 16234720 + ... + 16241188.
It is an arithmetic number, because the mean of its divisors is an integer number (5201918820).
Almost surely, 2105043324426 is an apocalyptic number.
105043324426 is a deficient number, since it is larger than the sum of its proper divisors (61418077814).
105043324426 is a wasteful number, since it uses less digits than its factorization.
105043324426 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10830.
The product of its (nonzero) digits is 69120, while the sum is 34.
Adding to 105043324426 its reverse (624423340501), we get a palindrome (729466664927).
The spelling of 105043324426 in words is "one hundred five billion, forty-three million, three hundred twenty-four thousand, four hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •