Base | Representation |
---|---|
bin | 11001101001101… |
… | …001111010111101 |
3 | 1002222210001020101 |
4 | 121221221322331 |
5 | 1340132200023 |
6 | 110411521101 |
7 | 13443625522 |
oct | 3151517275 |
9 | 1088701211 |
10 | 430350013 |
11 | 200a15375 |
12 | 100159191 |
13 | 6b2099a2 |
14 | 41225149 |
15 | 27bab1ad |
hex | 19a69ebd |
430350013 has 4 divisors (see below), whose sum is σ = 430618428. Its totient is φ = 430081600.
The previous prime is 430349947. The next prime is 430350043. The reversal of 430350013 is 310053034.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 310053034 = 2 ⋅155026517.
It can be written as a sum of positive squares in 2 ways, for example, as 150724729 + 279625284 = 12277^2 + 16722^2 .
It is a cyclic number.
It is not a de Polignac number, because 430350013 - 29 = 430349501 is a prime.
It is a super-2 number, since 2×4303500132 = 370402267378200338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (430350043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 131788 + ... + 135013.
It is an arithmetic number, because the mean of its divisors is an integer number (107654607).
Almost surely, 2430350013 is an apocalyptic number.
It is an amenable number.
430350013 is a deficient number, since it is larger than the sum of its proper divisors (268415).
430350013 is a wasteful number, since it uses less digits than its factorization.
430350013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 268414.
The product of its (nonzero) digits is 540, while the sum is 19.
The square root of 430350013 is about 20744.8791994555. The cubic root of 430350013 is about 754.9889699133.
The spelling of 430350013 in words is "four hundred thirty million, three hundred fifty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •