Base | Representation |
---|---|
bin | 110001001010000111… |
… | …0010101011110100100 |
3 | 101002111002001111022010 |
4 | 1202110032111132210 |
5 | 3212144344013220 |
6 | 120255113434220 |
7 | 10425011126562 |
oct | 1422416253644 |
9 | 332432044263 |
10 | 105566001060 |
11 | 4085228a083 |
12 | 18561a0b970 |
13 | 9c549c19b0 |
14 | 5176378a32 |
15 | 2b2cbe51e0 |
hex | 18943957a4 |
105566001060 has 48 divisors (see below), whose sum is σ = 318322097856. Its totient is φ = 25985476992.
The previous prime is 105566001053. The next prime is 105566001077. The reversal of 105566001060 is 60100665501.
It is a super-2 number, since 2×1055660010602 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67669734 + ... + 67671293.
It is an arithmetic number, because the mean of its divisors is an integer number (6631710372).
Almost surely, 2105566001060 is an apocalyptic number.
105566001060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105566001060 is an abundant number, since it is smaller than the sum of its proper divisors (212756096796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105566001060 is a wasteful number, since it uses less digits than its factorization.
105566001060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135341052 (or 135341050 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 30.
Adding to 105566001060 its reverse (60100665501), we get a palindrome (165666666561).
The spelling of 105566001060 in words is "one hundred five billion, five hundred sixty-six million, one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •