Base | Representation |
---|---|
bin | 10000011001001110011010… |
… | …101000000110011000011000 |
3 | 100110021220101222222210221211 |
4 | 100121032122220012120120 |
5 | 33422310311302413422 |
6 | 413203144215512504 |
7 | 21121132661353450 |
oct | 2031163250063030 |
9 | 313256358883854 |
10 | 72102210201112 |
11 | 20a79414a598a3 |
12 | 8105a84388734 |
13 | 3130294941400 |
14 | 13b3aa0b0ad60 |
15 | 850825c92577 |
hex | 41939aa06618 |
72102210201112 has 96 divisors (see below), whose sum is σ = 167384079007200. Its totient is φ = 28510289114112.
The previous prime is 72102210201079. The next prime is 72102210201143. The reversal of 72102210201112 is 21110201220127.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17946798 + ... + 21593794.
It is an arithmetic number, because the mean of its divisors is an integer number (1743584156325).
Almost surely, 272102210201112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 72102210201112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83692039503600).
72102210201112 is an abundant number, since it is smaller than the sum of its proper divisors (95281868806088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72102210201112 is a wasteful number, since it uses less digits than its factorization.
72102210201112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3649125 (or 3649108 counting only the distinct ones).
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 72102210201112 its reverse (21110201220127), we get a palindrome (93212411421239).
The spelling of 72102210201112 in words is "seventy-two trillion, one hundred two billion, two hundred ten million, two hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •