Base | Representation |
---|---|
bin | 110000111001010001… |
… | …1011011101010001100 |
3 | 101001000201002212001002 |
4 | 1201302203123222030 |
5 | 3210020240343220 |
6 | 120123054035432 |
7 | 10405011450434 |
oct | 1416243335214 |
9 | 331021085032 |
10 | 105001106060 |
11 | 40592429104 |
12 | 184247a8b78 |
13 | 9b949678b6 |
14 | 512132d2c4 |
15 | 2ae830dc75 |
hex | 18728dba8c |
105001106060 has 24 divisors (see below), whose sum is σ = 220511501280. Its totient is φ = 41998694144.
The previous prime is 105001106053. The next prime is 105001106069. The reversal of 105001106060 is 60601100501.
It is a happy number.
It is a super-2 number, since 2×1050011060602 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (105001106069) 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, 454052 + ... + 645108.
It is an arithmetic number, because the mean of its divisors is an integer number (9187979220).
Almost surely, 2105001106060 is an apocalyptic number.
105001106060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105001106060 is an abundant number, since it is smaller than the sum of its proper divisors (115510395220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105001106060 is a wasteful number, since it uses less digits than its factorization.
105001106060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 218545 (or 218543 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 105001106060 its reverse (60601100501), we get a palindrome (165602206561).
The spelling of 105001106060 in words is "one hundred five billion, one million, one hundred six thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •