Base | Representation |
---|---|
bin | 110000111001101111… |
… | …0110010001111001000 |
3 | 101001001210101022221022 |
4 | 1201303132302033020 |
5 | 3210033231240112 |
6 | 120124411332012 |
7 | 10405260632036 |
oct | 1416336621710 |
9 | 331053338838 |
10 | 105016665032 |
11 | 405a0195864 |
12 | 18429a51008 |
13 | 9b97c547a6 |
14 | 512341d556 |
15 | 2ae9883d72 |
hex | 18737b23c8 |
105016665032 has 32 divisors (see below), whose sum is σ = 201518966880. Its totient is φ = 51278680320.
The previous prime is 105016665029. The next prime is 105016665041. The reversal of 105016665032 is 230566610501.
It is a super-2 number, since 2×1050166650322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105016664983 and 105016665001.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2376128 + ... + 2419920.
It is an arithmetic number, because the mean of its divisors is an integer number (6297467715).
Almost surely, 2105016665032 is an apocalyptic number.
It is an amenable number.
105016665032 is a deficient number, since it is larger than the sum of its proper divisors (96502301848).
105016665032 is a wasteful number, since it uses less digits than its factorization.
105016665032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50813 (or 50809 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 105016665032 in words is "one hundred five billion, sixteen million, six hundred sixty-five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •