Base | Representation |
---|---|
bin | 111100100101111000… |
… | …1010010110110000011 |
3 | 110102212022011200100211 |
4 | 1321023301102312003 |
5 | 4112441234413243 |
6 | 135435412054551 |
7 | 12254333503624 |
oct | 1711361226603 |
9 | 412768150324 |
10 | 130120232323 |
11 | 5020252a494 |
12 | 21275004457 |
13 | c368a80413 |
14 | 6425445a4b |
15 | 35b86b2d9d |
hex | 1e4bc52d83 |
130120232323 has 8 divisors (see below), whose sum is σ = 133714395360. Its totient is φ = 126546093120.
The previous prime is 130120232309. The next prime is 130120232383. The reversal of 130120232323 is 323232021031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130120232323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130120232294 and 130120232303.
It is not an unprimeable number, because it can be changed into a prime (130120232383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4992783 + ... + 5018776.
It is an arithmetic number, because the mean of its divisors is an integer number (16714299420).
Almost surely, 2130120232323 is an apocalyptic number.
130120232323 is a deficient number, since it is larger than the sum of its proper divisors (3594163037).
130120232323 is a wasteful number, since it uses less digits than its factorization.
130120232323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10011917.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 130120232323 its reverse (323232021031), we get a palindrome (453352253354).
The spelling of 130120232323 in words is "one hundred thirty billion, one hundred twenty million, two hundred thirty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •