Base | Representation |
---|---|
bin | 111100100101111100… |
… | …0110011110011011010 |
3 | 110102212102212202201001 |
4 | 1321023320303303122 |
5 | 4112442240433310 |
6 | 135435522215214 |
7 | 12254356320241 |
oct | 1711370636332 |
9 | 412772782631 |
10 | 130122202330 |
11 | 5020365559a |
12 | 212757b450a |
13 | c3692bccc3 |
14 | 64257d9958 |
15 | 35b895193a |
hex | 1e4be33cda |
130122202330 has 8 divisors (see below), whose sum is σ = 234219964212. Its totient is φ = 52048880928.
The previous prime is 130122202321. The next prime is 130122202339. The reversal of 130122202330 is 33202221031.
It is an interprime number because it is at equal distance from previous prime (130122202321) and next prime (130122202339).
It can be written as a sum of positive squares in 2 ways, for example, as 121301048089 + 8821154241 = 348283^2 + 93921^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 130122202298 and 130122202307.
It is not an unprimeable number, because it can be changed into a prime (130122202339) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6506110107 + ... + 6506110126.
Almost surely, 2130122202330 is an apocalyptic number.
130122202330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130122202330 is a deficient number, since it is larger than the sum of its proper divisors (104097761882).
130122202330 is a wasteful number, since it uses less digits than its factorization.
130122202330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13012220240.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 130122202330 its reverse (33202221031), we get a palindrome (163324423361).
The spelling of 130122202330 in words is "one hundred thirty billion, one hundred twenty-two million, two hundred two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •