Base | Representation |
---|---|
bin | 11101100011110001111010… |
… | …111010010001101001101011 |
3 | 122001022002020010010220012220 |
4 | 131203301322322101221223 |
5 | 114014423331321243311 |
6 | 1140254053254405123 |
7 | 36245226012210111 |
oct | 3543617272215153 |
9 | 561262203126186 |
10 | 130002132212331 |
11 | 3847165a537985 |
12 | 126b734b0607a3 |
13 | 57701c1240ca2 |
14 | 24161cb431ab1 |
15 | 10069c1875206 |
hex | 763c7ae91a6b |
130002132212331 has 8 divisors (see below), whose sum is σ = 174055413530064. Its totient is φ = 86308469518080.
The previous prime is 130002132212317. The next prime is 130002132212347. The reversal of 130002132212331 is 133212231200031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130002132212331 - 25 = 130002132212299 is a prime.
It is a super-2 number, since 2×1300021322123312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (130002132212731) 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, 89904655026 + ... + 89904656471.
It is an arithmetic number, because the mean of its divisors is an integer number (21756926691258).
Almost surely, 2130002132212331 is an apocalyptic number.
130002132212331 is a deficient number, since it is larger than the sum of its proper divisors (44053281317733).
130002132212331 is a wasteful number, since it uses less digits than its factorization.
130002132212331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179809311741.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 130002132212331 its reverse (133212231200031), we get a palindrome (263214363412362).
The spelling of 130002132212331 in words is "one hundred thirty trillion, two billion, one hundred thirty-two million, two hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •