Base | Representation |
---|---|
bin | 110000111001100011101111… |
… | …0010101100011100001101101 |
3 | 2002101221101020110001001022011 |
4 | 1201303013132111203201231 |
5 | 422334114333343103123 |
6 | 4122443514541521221 |
7 | 156412243416432544 |
oct | 14163073625434155 |
9 | 2071841213031264 |
10 | 430123230050413 |
11 | 11506126808a519 |
12 | 402a891b573211 |
13 | 156005a6104aa3 |
14 | 783010ad0915b |
15 | 34ad75b744e0d |
hex | 18731de56386d |
430123230050413 has 8 divisors (see below), whose sum is σ = 439275089594880. Its totient is φ = 420971383066800.
The previous prime is 430123230050411. The next prime is 430123230050419. The reversal of 430123230050413 is 314050032321034.
It is a happy number.
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 430123230050413 - 21 = 430123230050411 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (430123230050411) 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, 106016188 + ... + 109998538.
It is an arithmetic number, because the mean of its divisors is an integer number (54909386199360).
Almost surely, 2430123230050413 is an apocalyptic number.
It is an amenable number.
430123230050413 is a deficient number, since it is larger than the sum of its proper divisors (9151859544467).
430123230050413 is a wasteful number, since it uses less digits than its factorization.
430123230050413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6280427.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 430123230050413 its reverse (314050032321034), we get a palindrome (744173262371447).
The spelling of 430123230050413 in words is "four hundred thirty trillion, one hundred twenty-three billion, two hundred thirty million, fifty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •