Base | Representation |
---|---|
bin | 110001100101111110… |
… | …1101001100101111100 |
3 | 101011220020201000222210 |
4 | 1203023331221211330 |
5 | 3221103243313400 |
6 | 120532001140420 |
7 | 10460124563541 |
oct | 1431375514574 |
9 | 334806630883 |
10 | 106501151100 |
11 | 4119213a153 |
12 | 1878302a710 |
13 | a073674506 |
14 | 5224644bc8 |
15 | 2b84d66950 |
hex | 18cbf6997c |
106501151100 has 36 divisors (see below), whose sum is σ = 308143331384. Its totient is φ = 28400306880.
The previous prime is 106501151077. The next prime is 106501151101. The reversal of 106501151100 is 1151105601.
It is a happy number.
It is a super-2 number, since 2×1065011511002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106501151101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 177501619 + ... + 177502218.
Almost surely, 2106501151100 is an apocalyptic number.
106501151100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106501151100 is an abundant number, since it is smaller than the sum of its proper divisors (201642180284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106501151100 is a wasteful number, since it uses less digits than its factorization.
106501151100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 355003854 (or 355003847 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 106501151100 its reverse (1151105601), we get a palindrome (107652256701).
It can be divided in two parts, 1065011 and 51100, that added together give a palindrome (1116111).
The spelling of 106501151100 in words is "one hundred six billion, five hundred one million, one hundred fifty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •