Base | Representation |
---|---|
bin | 10111001111001111001000… |
… | …011101101001011010000101 |
3 | 111101212102111202211100120100 |
4 | 113033033020131221122011 |
5 | 101343434410131221201 |
6 | 1001211000130554313 |
7 | 30345600363405621 |
oct | 2717171035513205 |
9 | 441772452740510 |
10 | 102202110023301 |
11 | 2a623742782972 |
12 | b567553a38999 |
13 | 4504804bb6682 |
14 | 1b34873abc181 |
15 | bc37a10b8886 |
hex | 5cf3c8769685 |
102202110023301 has 48 divisors (see below), whose sum is σ = 155726787041280. Its totient is φ = 64410916500000.
The previous prime is 102202110023281. The next prime is 102202110023381. The reversal of 102202110023301 is 103320011202201.
102202110023301 is a `hidden beast` number, since 1 + 0 + 220 + 2 + 110 + 0 + 2 + 330 + 1 = 666.
It is not a de Polignac number, because 102202110023301 - 217 = 102202109892229 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102202110023381) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 944591116 + ... + 944699306.
It is an arithmetic number, because the mean of its divisors is an integer number (3244308063360).
Almost surely, 2102202110023301 is an apocalyptic number.
It is an amenable number.
102202110023301 is a deficient number, since it is larger than the sum of its proper divisors (53524677017979).
102202110023301 is a wasteful number, since it uses less digits than its factorization.
102202110023301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119958 (or 119955 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 102202110023301 its reverse (103320011202201), we get a palindrome (205522121225502).
The spelling of 102202110023301 in words is "one hundred two trillion, two hundred two billion, one hundred ten million, twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •