Base | Representation |
---|---|
bin | 10111010011100110100001… |
… | …111111001000010101101001 |
3 | 111102221002212102211222020110 |
4 | 113103212201333020111221 |
5 | 101413343311210400131 |
6 | 1002000453102444533 |
7 | 30406350616005411 |
oct | 2723464177102551 |
9 | 442832772758213 |
10 | 102502112200041 |
11 | 2a7299a1126624 |
12 | b5b5719b93749 |
13 | 4526ba52c7c98 |
14 | 1b451b3229641 |
15 | bcb4ada57646 |
hex | 5d39a1fc8569 |
102502112200041 has 8 divisors (see below), whose sum is σ = 136670400165600. Its totient is φ = 68334282850592.
The previous prime is 102502112200021. The next prime is 102502112200069. The reversal of 102502112200041 is 140002211205201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102502112200041 - 210 = 102502112199017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102502112199990 and 102502112200017.
It is not an unprimeable number, because it can be changed into a prime (102502112200021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 114132180 + ... + 115026773.
It is an arithmetic number, because the mean of its divisors is an integer number (17083800020700).
Almost surely, 2102502112200041 is an apocalyptic number.
It is an amenable number.
102502112200041 is a deficient number, since it is larger than the sum of its proper divisors (34168287965559).
102502112200041 is a wasteful number, since it uses less digits than its factorization.
102502112200041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229308055.
The product of its (nonzero) digits is 320, while the sum is 21.
Adding to 102502112200041 its reverse (140002211205201), we get a palindrome (242504323405242).
The spelling of 102502112200041 in words is "one hundred two trillion, five hundred two billion, one hundred twelve million, two hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •