Base | Representation |
---|---|
bin | 110001010111001101… |
… | …1010100001011100011 |
3 | 101010121201021000002110 |
4 | 1202232123110023203 |
5 | 3214044414024420 |
6 | 120410500050403 |
7 | 10441626554106 |
oct | 1425633241343 |
9 | 333551230073 |
10 | 106005611235 |
11 | 40a58449777 |
12 | 18665093a03 |
13 | 9cc4ac1564 |
14 | 51b88d073d |
15 | 2b565ceee0 |
hex | 18ae6d42e3 |
106005611235 has 16 divisors (see below), whose sum is σ = 170187855264. Its totient is φ = 56343366912.
The previous prime is 106005611219. The next prime is 106005611249. The reversal of 106005611235 is 532116500601.
It is not a de Polignac number, because 106005611235 - 24 = 106005611219 is a prime.
It is a super-2 number, since 2×1060056112352 (a number of 23 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 12055402 + ... + 12064191.
It is an arithmetic number, because the mean of its divisors is an integer number (10636740954).
Almost surely, 2106005611235 is an apocalyptic number.
106005611235 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
106005611235 is a deficient number, since it is larger than the sum of its proper divisors (64182244029).
106005611235 is a wasteful number, since it uses less digits than its factorization.
106005611235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24119894.
The product of its (nonzero) digits is 5400, while the sum is 30.
The spelling of 106005611235 in words is "one hundred six billion, five million, six hundred eleven thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •