Base | Representation |
---|---|
bin | 111100101011001111… |
… | …1001001010110011111 |
3 | 110110022211111001111002 |
4 | 1321112133021112133 |
5 | 4113323301233343 |
6 | 135505313420515 |
7 | 12261645634355 |
oct | 1712637112637 |
9 | 413284431432 |
10 | 130300024223 |
11 | 50294a6a836 |
12 | 2130526a73b |
13 | c3970b0665 |
14 | 64412877d5 |
15 | 35c93798b8 |
hex | 1e567c959f |
130300024223 has 8 divisors (see below), whose sum is σ = 130454774208. Its totient is φ = 130145368864.
The previous prime is 130300024157. The next prime is 130300024307. The reversal of 130300024223 is 322420003031.
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 130300024223 - 220 = 130298975647 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130300024195 and 130300024204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130300021223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2949365 + ... + 2993217.
It is an arithmetic number, because the mean of its divisors is an integer number (16306846776).
Almost surely, 2130300024223 is an apocalyptic number.
130300024223 is a deficient number, since it is larger than the sum of its proper divisors (154749985).
130300024223 is a wasteful number, since it uses less digits than its factorization.
130300024223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47313.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 130300024223 its reverse (322420003031), we get a palindrome (452720027254).
The spelling of 130300024223 in words is "one hundred thirty billion, three hundred million, twenty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •