Base | Representation |
---|---|
bin | 11101101000100011011111… |
… | …001000101011011100111010 |
3 | 122002110110002220022121202102 |
4 | 131220203133020223130322 |
5 | 114040312303143132442 |
6 | 1141104514235103402 |
7 | 36311022424614566 |
oct | 3550433710533472 |
9 | 562413086277672 |
10 | 130330231224122 |
11 | 38588816907676 |
12 | 1274aa568a1b62 |
13 | 579511b646397 |
14 | 24280343386a6 |
15 | 10102c5d07232 |
hex | 7688df22b73a |
130330231224122 has 8 divisors (see below), whose sum is σ = 195510642653172. Its totient is φ = 65160017006400.
The previous prime is 130330231224113. The next prime is 130330231224131. The reversal of 130330231224122 is 221422132033031.
It is an interprime number because it is at equal distance from previous prime (130330231224113) and next prime (130330231224131).
It can be written as a sum of positive squares in 2 ways, for example, as 127049890832881 + 3280340391241 = 11271641^2 + 1811171^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1303302312241222 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2549270879 + ... + 2549322002.
Almost surely, 2130330231224122 is an apocalyptic number.
130330231224122 is a deficient number, since it is larger than the sum of its proper divisors (65180411429050).
130330231224122 is a wasteful number, since it uses less digits than its factorization.
130330231224122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5098605664.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 130330231224122 its reverse (221422132033031), we get a palindrome (351752363257153).
The spelling of 130330231224122 in words is "one hundred thirty trillion, three hundred thirty billion, two hundred thirty-one million, two hundred twenty-four thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •