Base | Representation |
---|---|
bin | 10111001101111001101000… |
… | …001110100000111001001001 |
3 | 111101112122112110012100202102 |
4 | 113031321220032200321021 |
5 | 101340433344042132223 |
6 | 1001100454051443145 |
7 | 30336140310605600 |
oct | 2715715016407111 |
9 | 441478473170672 |
10 | 102110301130313 |
11 | 2a59880aa837a3 |
12 | b5517b12b64b5 |
13 | 44c8c633ac618 |
14 | 1b30244870a37 |
15 | bc11cb028928 |
hex | 5cde683a0e49 |
102110301130313 has 12 divisors (see below), whose sum is σ = 122613027823872. Its totient is φ = 84699788954760.
The previous prime is 102110301130309. The next prime is 102110301130351. The reversal of 102110301130313 is 313031103011201.
It is not a de Polignac number, because 102110301130313 - 22 = 102110301130309 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102110301130913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 33611025845 + ... + 33611028882.
It is an arithmetic number, because the mean of its divisors is an integer number (10217752318656).
Almost surely, 2102110301130313 is an apocalyptic number.
It is an amenable number.
102110301130313 is a deficient number, since it is larger than the sum of its proper divisors (20502726693559).
102110301130313 is an equidigital number, since it uses as much as digits as its factorization.
102110301130313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67222054772 (or 67222054765 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 102110301130313 its reverse (313031103011201), we get a palindrome (415141404141514).
The spelling of 102110301130313 in words is "one hundred two trillion, one hundred ten billion, three hundred one million, one hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.273 sec. • engine limits •