Base | Representation |
---|---|
bin | 10111010000101100011100… |
… | …111010000101011100010000 |
3 | 111102020000010221122222122002 |
4 | 113100230130322011130100 |
5 | 101402110113104341422 |
6 | 1001325011033533132 |
7 | 30356045430640421 |
oct | 2720543472053420 |
9 | 442200127588562 |
10 | 102302311012112 |
11 | 2a662191606922 |
12 | b582a58b741a8 |
13 | 45110b32384b3 |
14 | 1b3965b6db648 |
15 | bc61b7ca5692 |
hex | 5d0b1ce85710 |
102302311012112 has 80 divisors (see below), whose sum is σ = 208345035064320. Its totient is φ = 48568558448256.
The previous prime is 102302311012073. The next prime is 102302311012163. The reversal of 102302311012112 is 211210113203201.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 384683573 + ... + 384949419.
It is an arithmetic number, because the mean of its divisors is an integer number (2604312938304).
Almost surely, 2102302311012112 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 102302311012112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (104172517532160).
102302311012112 is an abundant number, since it is smaller than the sum of its proper divisors (106042724052208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102302311012112 is a wasteful number, since it uses less digits than its factorization.
102302311012112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273540 (or 273534 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 102302311012112 its reverse (211210113203201), we get a palindrome (313512424215313).
The spelling of 102302311012112 in words is "one hundred two trillion, three hundred two billion, three hundred eleven million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.758 sec. • engine limits •