Base | Representation |
---|---|
bin | 101111010100010000… |
… | …1110011000111111100 |
3 | 100201021111022011220220 |
4 | 1132220201303013330 |
5 | 3131100042232002 |
6 | 114402454541340 |
7 | 10225014013515 |
oct | 1365041630774 |
9 | 321244264826 |
10 | 101611680252 |
11 | 3a103165355 |
12 | 17839667850 |
13 | 97746a4ab4 |
14 | 4cbd115a0c |
15 | 299a9947bc |
hex | 17a88731fc |
101611680252 has 12 divisors (see below), whose sum is σ = 237093920616. Its totient is φ = 33870560080.
The previous prime is 101611680239. The next prime is 101611680263. The reversal of 101611680252 is 252086116101.
101611680252 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4233819999 + ... + 4233820022.
It is an arithmetic number, because the mean of its divisors is an integer number (19757826718).
Almost surely, 2101611680252 is an apocalyptic number.
101611680252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101611680252 is an abundant number, since it is smaller than the sum of its proper divisors (135482240364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101611680252 is a wasteful number, since it uses less digits than its factorization.
101611680252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8467640028 (or 8467640026 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 33.
Adding to 101611680252 its reverse (252086116101), we get a palindrome (353697796353).
The spelling of 101611680252 in words is "one hundred one billion, six hundred eleven million, six hundred eighty thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •