Base | Representation |
---|---|
bin | 10111111011110101000000… |
… | …100010110001101111110110 |
3 | 111210201101001221100212212011 |
4 | 113323311000202301233312 |
5 | 102244141130144104100 |
6 | 1011514422214114434 |
7 | 31113151265212264 |
oct | 2773650042615766 |
9 | 453641057325764 |
10 | 105266436316150 |
11 | 305a527701253a |
12 | b98141064ba1a |
13 | 469777556a745 |
14 | 1bdcccbc77434 |
15 | c2834cc89bba |
hex | 5fbd408b1bf6 |
105266436316150 has 96 divisors (see below), whose sum is σ = 204650241546240. Its totient is φ = 40232557854720.
The previous prime is 105266436316133. The next prime is 105266436316157. The reversal of 105266436316150 is 51613634662501.
It is a super-2 number, since 2×1052664363161502 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105266436316094 and 105266436316103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105266436316157) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3639022987 + ... + 3639051913.
It is an arithmetic number, because the mean of its divisors is an integer number (2131773349440).
Almost surely, 2105266436316150 is an apocalyptic number.
105266436316150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105266436316150 is a deficient number, since it is larger than the sum of its proper divisors (99383805230090).
105266436316150 is a wasteful number, since it uses less digits than its factorization.
105266436316150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54938 (or 54933 counting only the distinct ones).
The product of its (nonzero) digits is 2332800, while the sum is 49.
The spelling of 105266436316150 in words is "one hundred five trillion, two hundred sixty-six billion, four hundred thirty-six million, three hundred sixteen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •