Base | Representation |
---|---|
bin | 11101100110101100010010… |
… | …011001010011100110101111 |
3 | 122002000012202010101122012220 |
4 | 131212230102121103212233 |
5 | 114031213143000431111 |
6 | 1140530030114130423 |
7 | 36265541640103566 |
oct | 3546542231234657 |
9 | 562005663348186 |
10 | 130202242202031 |
11 | 385395083a2a5a |
12 | 1272a097580a13 |
13 | 578603229090c |
14 | 2421b71d84bdd |
15 | 100bcd47c3e06 |
hex | 766b126539af |
130202242202031 has 8 divisors (see below), whose sum is σ = 174150633104304. Its totient is φ = 86527673050560.
The previous prime is 130202242202029. The next prime is 130202242202057.
130202242202031 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130202242202031 - 21 = 130202242202029 is a prime.
It is a super-2 number, since 2×1302022422020312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130202242201992 and 130202242202010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130202242202731) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 68455436590 + ... + 68455438491.
It is an arithmetic number, because the mean of its divisors is an integer number (21768829138038).
Almost surely, 2130202242202031 is an apocalyptic number.
130202242202031 is a deficient number, since it is larger than the sum of its proper divisors (43948390902273).
130202242202031 is a wasteful number, since it uses less digits than its factorization.
130202242202031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136910875401.
The product of its (nonzero) digits is 2304, while the sum is 24.
The spelling of 130202242202031 in words is "one hundred thirty trillion, two hundred two billion, two hundred forty-two million, two hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •