Base | Representation |
---|---|
bin | 10011100011110100… |
… | …01011001011111100 |
3 | 1000002211111120212200 |
4 | 21301322023023330 |
5 | 133001224311142 |
6 | 4454001031500 |
7 | 521140054002 |
oct | 116172131374 |
9 | 30084446780 |
10 | 10501010172 |
11 | 44a9601404 |
12 | 2050925590 |
13 | cb47372b3 |
14 | 7188dca72 |
15 | 416d7564c |
hex | 271e8b2fc |
10501010172 has 18 divisors (see below), whose sum is σ = 26544220248. Its totient is φ = 3500336712.
The previous prime is 10501010161. The next prime is 10501010209. The reversal of 10501010172 is 27101010501.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (18).
It is a super-2 number, since 2×105010101722 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 145847328 + ... + 145847399.
Almost surely, 210501010172 is an apocalyptic number.
10501010172 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10501010172 is an abundant number, since it is smaller than the sum of its proper divisors (16043210076).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10501010172 is a wasteful number, since it uses less digits than its factorization.
10501010172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291694737 (or 291694732 counting only the distinct ones).
The product of its (nonzero) digits is 70, while the sum is 18.
Adding to 10501010172 its reverse (27101010501), we get a palindrome (37602020673).
The spelling of 10501010172 in words is "ten billion, five hundred one million, ten thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •