Base | Representation |
---|---|
bin | 10011110001000100… |
… | …01011011010101100 |
3 | 1000101120122121000100 |
4 | 21320202023122230 |
5 | 133213203111142 |
6 | 4513011231100 |
7 | 523656605325 |
oct | 117042133254 |
9 | 30346577010 |
10 | 10612160172 |
11 | 4556319009 |
12 | 2081ba8490 |
13 | 1001782c23 |
14 | 72959344c |
15 | 4219cdb4c |
hex | 27888b6ac |
10612160172 has 36 divisors (see below), whose sum is σ = 28403136216. Its totient is φ = 3329304960.
The previous prime is 10612160159. The next prime is 10612160173. The reversal of 10612160172 is 27106121601.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×106121601722 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10612160173) 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, 8669454 + ... + 8670677.
It is an arithmetic number, because the mean of its divisors is an integer number (788976006).
Almost surely, 210612160172 is an apocalyptic number.
10612160172 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10612160172 is an abundant number, since it is smaller than the sum of its proper divisors (17790976044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10612160172 is a wasteful number, since it uses less digits than its factorization.
10612160172 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17340158 (or 17340153 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
Adding to 10612160172 its reverse (27106121601), we get a palindrome (37718281773).
The spelling of 10612160172 in words is "ten billion, six hundred twelve million, one hundred sixty thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •