Base | Representation |
---|---|
bin | 10111001110011110111001… |
… | …001100101100100101111110 |
3 | 111101200110211001001201000200 |
4 | 113032132321030230211332 |
5 | 101342112320431022420 |
6 | 1001131112341104330 |
7 | 30342055005216246 |
oct | 2716367114544576 |
9 | 441613731051020 |
10 | 102150314314110 |
11 | 2a603783416a37 |
12 | b5594b96b80a6 |
13 | 44cc96c0c993a |
14 | 1b3215cab0b26 |
15 | bc226dc66b90 |
hex | 5ce7b932c97e |
102150314314110 has 48 divisors (see below), whose sum is σ = 265592146993056. Its totient is φ = 27239947429824.
The previous prime is 102150314314031. The next prime is 102150314314151. The reversal of 102150314314110 is 11413413051201.
102150314314110 is a `hidden beast` number, since 1 + 0 + 2 + 1 + 503 + 1 + 4 + 3 + 141 + 10 = 666.
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, 15918072 + ... + 21393588.
It is an arithmetic number, because the mean of its divisors is an integer number (5533169729022).
Almost surely, 2102150314314110 is an apocalyptic number.
102150314314110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102150314314110 is an abundant number, since it is smaller than the sum of its proper divisors (163441832678946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102150314314110 is a wasteful number, since it uses less digits than its factorization.
102150314314110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5682817 (or 5682814 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
Adding to 102150314314110 its reverse (11413413051201), we get a palindrome (113563727365311).
The spelling of 102150314314110 in words is "one hundred two trillion, one hundred fifty billion, three hundred fourteen million, three hundred fourteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •