Base | Representation |
---|---|
bin | 110001001100110001… |
… | …1110000010010010010 |
3 | 101002201022110121110122 |
4 | 1202121203300102102 |
5 | 3212340302030340 |
6 | 120312032030242 |
7 | 10430145643304 |
oct | 1423143602222 |
9 | 332638417418 |
10 | 105655501970 |
11 | 4089885a477 |
12 | 18587992382 |
13 | 9c6a3ca705 |
14 | 51841d5974 |
15 | 2b359c3db5 |
hex | 18998f0492 |
105655501970 has 64 divisors (see below), whose sum is σ = 192706076160. Its totient is φ = 41706190848.
The previous prime is 105655501957. The next prime is 105655502003. The reversal of 105655501970 is 79105556501.
It is a super-2 number, since 2×1056555019702 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 187664909 + ... + 187665471.
It is an arithmetic number, because the mean of its divisors is an integer number (3011032440).
Almost surely, 2105655501970 is an apocalyptic number.
105655501970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105655501970 is a deficient number, since it is larger than the sum of its proper divisors (87050574190).
105655501970 is a wasteful number, since it uses less digits than its factorization.
105655501970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1379.
The product of its (nonzero) digits is 236250, while the sum is 44.
The spelling of 105655501970 in words is "one hundred five billion, six hundred fifty-five million, five hundred one thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •