Base | Representation |
---|---|
bin | 110001011011001001… |
… | …0100100010000110100 |
3 | 101010221220111110012211 |
4 | 1202312102210100310 |
5 | 3214332202114130 |
6 | 120431531423204 |
7 | 10445121111061 |
oct | 1426622442064 |
9 | 333856443184 |
10 | 106137535540 |
11 | 41015965423 |
12 | 186a12b4b04 |
13 | a016231b8a |
14 | 51cc231c68 |
15 | 2b62e8da2a |
hex | 18b64a4434 |
106137535540 has 24 divisors (see below), whose sum is σ = 228072287520. Its totient is φ = 41467687968.
The previous prime is 106137535523. The next prime is 106137535547. The reversal of 106137535540 is 45535731601.
It is a super-2 number, since 2×1061375355402 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106137535493 and 106137535502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106137535547) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61707010 + ... + 61708729.
It is an arithmetic number, because the mean of its divisors is an integer number (9503011980).
Almost surely, 2106137535540 is an apocalyptic number.
106137535540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106137535540 is an abundant number, since it is smaller than the sum of its proper divisors (121934751980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106137535540 is a wasteful number, since it uses less digits than its factorization.
106137535540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123415791 (or 123415789 counting only the distinct ones).
The product of its (nonzero) digits is 189000, while the sum is 40.
The spelling of 106137535540 in words is "one hundred six billion, one hundred thirty-seven million, five hundred thirty-five thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •