Base | Representation |
---|---|
bin | 11101110010010101001101… |
… | …110001001011100011110011 |
3 | 122011211200022202011020020121 |
4 | 131302111031301023203303 |
5 | 114132314301132431311 |
6 | 1142341311314351111 |
7 | 36410406134145610 |
oct | 3562251561134363 |
9 | 564750282136217 |
10 | 131002102233331 |
11 | 3881775254713a |
12 | 12839102b8b497 |
13 | 58135a3241274 |
14 | 244c76d8b3507 |
15 | 10229ea668b71 |
hex | 77254dc4b8f3 |
131002102233331 has 32 divisors (see below), whose sum is σ = 151061985285120. Its totient is φ = 111283928251776.
The previous prime is 131002102233293. The next prime is 131002102233341. The reversal of 131002102233331 is 133332201200131.
It is not a de Polignac number, because 131002102233331 - 233 = 130993512298739 is a prime.
It is a super-2 number, since 2×1310021022333312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131002102233296 and 131002102233305.
It is not an unprimeable number, because it can be changed into a prime (131002102233341) 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, 408150610 + ... + 408471448.
It is an arithmetic number, because the mean of its divisors is an integer number (4720687040160).
Almost surely, 2131002102233331 is an apocalyptic number.
131002102233331 is a deficient number, since it is larger than the sum of its proper divisors (20059883051789).
131002102233331 is a wasteful number, since it uses less digits than its factorization.
131002102233331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 322243.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 131002102233331 its reverse (133332201200131), we get a palindrome (264334303433462).
The spelling of 131002102233331 in words is "one hundred thirty-one trillion, two billion, one hundred two million, two hundred thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •