Base | Representation |
---|---|
bin | 1011111110100010… |
… | …11101100110001001 |
3 | 121121010122121122022 |
4 | 11333101131212021 |
5 | 101132121021101 |
6 | 2542022334225 |
7 | 315230143430 |
oct | 57721354611 |
9 | 17533577568 |
10 | 6430251401 |
11 | 27aa789062 |
12 | 12b558a375 |
13 | 7b626c8b2 |
14 | 45000a117 |
15 | 2797c4a1b |
hex | 17f45d989 |
6430251401 has 4 divisors (see below), whose sum is σ = 7348858752. Its totient is φ = 5511644052.
The previous prime is 6430251371. The next prime is 6430251439. The reversal of 6430251401 is 1041520346.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 6430251401 - 26 = 6430251337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6430251481) 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, 459303665 + ... + 459303678.
It is an arithmetic number, because the mean of its divisors is an integer number (1837214688).
Almost surely, 26430251401 is an apocalyptic number.
It is an amenable number.
6430251401 is a deficient number, since it is larger than the sum of its proper divisors (918607351).
6430251401 is an equidigital number, since it uses as much as digits as its factorization.
6430251401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 918607350.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 6430251401 is about 80188.8483581102. The cubic root of 6430251401 is about 1859.5562398598.
Adding to 6430251401 its reverse (1041520346), we get a palindrome (7471771747).
The spelling of 6430251401 in words is "six billion, four hundred thirty million, two hundred fifty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •