Base | Representation |
---|---|
bin | 110001100100101010… |
… | …0100000010010100000 |
3 | 101011210011021022100010 |
4 | 1203021110200102200 |
5 | 3221010420420111 |
6 | 120523334524520 |
7 | 10456045650240 |
oct | 1431124402240 |
9 | 334704238303 |
10 | 106456810656 |
11 | 4116a104559 |
12 | 18770206740 |
13 | a06741b171 |
14 | 521c7c1b20 |
15 | 2b81008aa6 |
hex | 18c95204a0 |
106456810656 has 48 divisors (see below), whose sum is σ = 319370433984. Its totient is φ = 30416231424.
The previous prime is 106456810631. The next prime is 106456810667. The reversal of 106456810656 is 656018654601.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-3 number, since 3×1064568106563 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 79208265 + ... + 79209608.
It is an arithmetic number, because the mean of its divisors is an integer number (6653550708).
Almost surely, 2106456810656 is an apocalyptic number.
106456810656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
106456810656 is an abundant number, since it is smaller than the sum of its proper divisors (212913623328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106456810656 is a wasteful number, since it uses less digits than its factorization.
106456810656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158417893 (or 158417885 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 48.
The spelling of 106456810656 in words is "one hundred six billion, four hundred fifty-six million, eight hundred ten thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •