Base | Representation |
---|---|
bin | 1100100001111010000… |
… | …00010001111000110001 |
3 | 1112011020200201211111121 |
4 | 12100331000101320301 |
5 | 24023201133304131 |
6 | 525440034142241 |
7 | 43050456300652 |
oct | 6207500217061 |
9 | 1464220654447 |
10 | 430520213041 |
11 | 156645489166 |
12 | 6b530421981 |
13 | 317a07148b9 |
14 | 16ba1745529 |
15 | b2eb02e911 |
hex | 643d011e31 |
430520213041 has 8 divisors (see below), whose sum is σ = 441077011200. Its totient is φ = 419966096160.
The previous prime is 430520213029. The next prime is 430520213093. The reversal of 430520213041 is 140312025034.
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 430520213041 - 25 = 430520213009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 430520212997 and 430520213015.
It is not an unprimeable number, because it can be changed into a prime (430520213341) 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, 343321 + ... + 989398.
It is an arithmetic number, because the mean of its divisors is an integer number (55134626400).
Almost surely, 2430520213041 is an apocalyptic number.
430520213041 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
430520213041 is a deficient number, since it is larger than the sum of its proper divisors (10556798159).
430520213041 is a wasteful number, since it uses less digits than its factorization.
430520213041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1340639.
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 430520213041 its reverse (140312025034), we get a palindrome (570832238075).
The spelling of 430520213041 in words is "four hundred thirty billion, five hundred twenty million, two hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •