Base | Representation |
---|---|
bin | 111100101000010011… |
… | …0001111010101000111 |
3 | 110110001221120022011002 |
4 | 1321100212033111013 |
5 | 4113123003023143 |
6 | 135451424003515 |
7 | 12256336053551 |
oct | 1712046172507 |
9 | 413057508132 |
10 | 130201220423 |
11 | 50244215aaa |
12 | 2129816059b |
13 | c37c798481 |
14 | 64320c84d1 |
15 | 35c085e5b8 |
hex | 1e5098f547 |
130201220423 has 4 divisors (see below), whose sum is σ = 137860115760. Its totient is φ = 122542325088.
The previous prime is 130201220323. The next prime is 130201220519. The reversal of 130201220423 is 324022102031.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 130201220423 - 216 = 130201154887 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130201220395 and 130201220404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130201220323) 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 3 ways as a sum of consecutive naturals, for example, 3829447643 + ... + 3829447676.
It is an arithmetic number, because the mean of its divisors is an integer number (34465028940).
Almost surely, 2130201220423 is an apocalyptic number.
130201220423 is a deficient number, since it is larger than the sum of its proper divisors (7658895337).
130201220423 is an equidigital number, since it uses as much as digits as its factorization.
130201220423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7658895336.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 130201220423 its reverse (324022102031), we get a palindrome (454223322454).
The spelling of 130201220423 in words is "one hundred thirty billion, two hundred one million, two hundred twenty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •