Base | Representation |
---|---|
bin | 10111001100110000000011… |
… | …100010000000101101001101 |
3 | 111101021002121220000120012021 |
4 | 113030300003202000231031 |
5 | 101333140101344044323 |
6 | 1001000311101210141 |
7 | 30330342534106213 |
oct | 2714600342005515 |
9 | 441232556016167 |
10 | 102031302331213 |
11 | 2a568261240782 |
12 | b53a424860951 |
13 | 44c1683815498 |
14 | 1b2a4aca76cb3 |
15 | bbe1058c705d |
hex | 5ccc03880b4d |
102031302331213 has 16 divisors (see below), whose sum is σ = 104511140697600. Its totient is φ = 99581764613760.
The previous prime is 102031302331199. The next prime is 102031302331219. The reversal of 102031302331213 is 312133203130201.
It is a cyclic number.
It is not a de Polignac number, because 102031302331213 - 213 = 102031302323021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102031302331219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24966520 + ... + 28764382.
It is an arithmetic number, because the mean of its divisors is an integer number (6531946293600).
Almost surely, 2102031302331213 is an apocalyptic number.
It is an amenable number.
102031302331213 is a deficient number, since it is larger than the sum of its proper divisors (2479838366387).
102031302331213 is an equidigital number, since it uses as much as digits as its factorization.
102031302331213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3801852.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 102031302331213 its reverse (312133203130201), we get a palindrome (414164505461414).
The spelling of 102031302331213 in words is "one hundred two trillion, thirty-one billion, three hundred two million, three hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •