Base | Representation |
---|---|
bin | 111100101000010001… |
… | …0000111101010000111 |
3 | 110110001212112102200002 |
4 | 1321100202013222013 |
5 | 4113122213443143 |
6 | 135451344511515 |
7 | 12256323635063 |
oct | 1712042075207 |
9 | 413055472602 |
10 | 130200140423 |
11 | 50243648641 |
12 | 2129791b59b |
13 | c37c4aaa12 |
14 | 6431cc6aa3 |
15 | 35c06e95b8 |
hex | 1e50887a87 |
130200140423 has 8 divisors (see below), whose sum is σ = 130676402448. Its totient is φ = 129724714944.
The previous prime is 130200140417. The next prime is 130200140437. The reversal of 130200140423 is 324041002031.
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 130200140423 - 24 = 130200140407 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130200140395 and 130200140404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130200140443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 103565 + ... + 520697.
It is an arithmetic number, because the mean of its divisors is an integer number (16334550306).
Almost surely, 2130200140423 is an apocalyptic number.
130200140423 is a deficient number, since it is larger than the sum of its proper divisors (476262025).
130200140423 is an equidigital number, since it uses as much as digits as its factorization.
130200140423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418273.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 130200140423 its reverse (324041002031), we get a palindrome (454241142454).
The spelling of 130200140423 in words is "one hundred thirty billion, two hundred million, one hundred forty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •