Base | Representation |
---|---|
bin | 10111010000101100001011… |
… | …000010110110111100000001 |
3 | 111102012222101001202011020111 |
4 | 113100230023002312330001 |
5 | 101402104004344301423 |
6 | 1001324521210311321 |
7 | 30356035131421561 |
oct | 2720541302667401 |
9 | 442188331664214 |
10 | 102302011322113 |
11 | 2a662048424339 |
12 | b582994728541 |
13 | 4511066118835 |
14 | 1b3962d9a8da1 |
15 | bc619b80860d |
hex | 5d0b0b0b6f01 |
102302011322113 has 32 divisors (see below), whose sum is σ = 110000792973312. Its totient is φ = 94793923257600.
The previous prime is 102302011322059. The next prime is 102302011322131. The reversal of 102302011322113 is 311223110203201.
It is a de Polignac number, because none of the positive numbers 2k-102302011322113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102302011328113) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3331972120 + ... + 3332002822.
It is an arithmetic number, because the mean of its divisors is an integer number (3437524780416).
Almost surely, 2102302011322113 is an apocalyptic number.
It is an amenable number.
102302011322113 is a deficient number, since it is larger than the sum of its proper divisors (7698781651199).
102302011322113 is a wasteful number, since it uses less digits than its factorization.
102302011322113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34605.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 102302011322113 its reverse (311223110203201), we get a palindrome (413525121525314).
The spelling of 102302011322113 in words is "one hundred two trillion, three hundred two billion, eleven million, three hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •