Base | Representation |
---|---|
bin | 111100100010111101… |
… | …1110101101100101111 |
3 | 110102121110221220001112 |
4 | 1321011323311230233 |
5 | 4112241204130411 |
6 | 135421553502235 |
7 | 12252034411550 |
oct | 1710573655457 |
9 | 412543856045 |
10 | 130022333231 |
11 | 5016224344a |
12 | 2124827197b |
13 | c3516c3c6b |
14 | 6416440327 |
15 | 35aecc5b8b |
hex | 1e45ef5b2f |
130022333231 has 8 divisors (see below), whose sum is σ = 157337949600. Its totient is φ = 104891966208.
The previous prime is 130022333227. The next prime is 130022333239. The reversal of 130022333231 is 132333220031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130022333231 - 22 = 130022333227 is a prime.
It is a super-2 number, since 2×1300223332312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130022333197 and 130022333206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130022333239) 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, 546312206 + ... + 546312443.
It is an arithmetic number, because the mean of its divisors is an integer number (19667243700).
Almost surely, 2130022333231 is an apocalyptic number.
130022333231 is a deficient number, since it is larger than the sum of its proper divisors (27315616369).
130022333231 is a wasteful number, since it uses less digits than its factorization.
130022333231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1092624673.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 130022333231 its reverse (132333220031), we get a palindrome (262355553262).
The spelling of 130022333231 in words is "one hundred thirty billion, twenty-two million, three hundred thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •