Base | Representation |
---|---|
bin | 111100101100001001… |
… | …0101011100101101111 |
3 | 110110101221110210011102 |
4 | 1321120102223211233 |
5 | 4113404024423043 |
6 | 135512314513315 |
7 | 12262464236153 |
oct | 1713022534557 |
9 | 413357423142 |
10 | 130330311023 |
11 | 50300076750 |
12 | 2131343583b |
13 | c3a0456043 |
14 | 64452cd063 |
15 | 35cbd5d6b8 |
hex | 1e584ab96f |
130330311023 has 8 divisors (see below), whose sum is σ = 142292370000. Its totient is φ = 118387226880.
The previous prime is 130330310951. The next prime is 130330311029. The reversal of 130330311023 is 320113033031.
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 130330311023 - 28 = 130330310767 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130330310986 and 130330311004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130330311029) 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, 4729340 + ... + 4756817.
It is an arithmetic number, because the mean of its divisors is an integer number (17786546250).
Almost surely, 2130330311023 is an apocalyptic number.
130330311023 is a deficient number, since it is larger than the sum of its proper divisors (11962058977).
130330311023 is a wasteful number, since it uses less digits than its factorization.
130330311023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9487417.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 130330311023 its reverse (320113033031), we get a palindrome (450443344054).
The spelling of 130330311023 in words is "one hundred thirty billion, three hundred thirty million, three hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •