Base | Representation |
---|---|
bin | 101111000101110001… |
… | …1010101011000000010 |
3 | 100200000121112212120021 |
4 | 1132023203111120002 |
5 | 3124101114342201 |
6 | 114242331204054 |
7 | 10206661636135 |
oct | 1361343253002 |
9 | 320017485507 |
10 | 101125543426 |
11 | 39983807586 |
12 | 177228a662a |
13 | 96c7a64a7b |
14 | 4c7472c21c |
15 | 296ce68ea1 |
hex | 178b8d5602 |
101125543426 has 8 divisors (see below), whose sum is σ = 160611157260. Its totient is φ = 47588491008.
The previous prime is 101125543381. The next prime is 101125543427. The reversal of 101125543426 is 624345521101.
It can be written as a sum of positive squares in 2 ways, for example, as 96069622401 + 5055921025 = 309951^2 + 71105^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (34), and also a Moran number because the ratio is a prime number: 2974280689 = 101125543426 / (1 + 0 + 1 + 1 + 2 + 5 + 5 + 4 + 3 + 4 + 2 + 6).
It is a junction number, because it is equal to n+sod(n) for n = 101125543391 and 101125543400.
It is not an unprimeable number, because it can be changed into a prime (101125543427) 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 3 ways as a sum of consecutive naturals, for example, 1487140311 + ... + 1487140378.
Almost surely, 2101125543426 is an apocalyptic number.
101125543426 is a deficient number, since it is larger than the sum of its proper divisors (59485613834).
101125543426 is a wasteful number, since it uses less digits than its factorization.
101125543426 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2974280708.
The product of its (nonzero) digits is 28800, while the sum is 34.
The spelling of 101125543426 in words is "one hundred one billion, one hundred twenty-five million, five hundred forty-three thousand, four hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •