Base | Representation |
---|---|
bin | 11001011010010… |
… | …000001001101101 |
3 | 1002201011220112111 |
4 | 121122100021231 |
5 | 1333113443201 |
6 | 110145204021 |
7 | 13364411002 |
oct | 3132201155 |
9 | 1081156474 |
10 | 426312301 |
11 | 1a9707818 |
12 | ba930611 |
13 | 6a424bcc |
14 | 408938a9 |
15 | 2765eb51 |
hex | 1969026d |
426312301 has 8 divisors (see below), whose sum is σ = 437076864. Its totient is φ = 415565280.
The previous prime is 426312283. The next prime is 426312311. The reversal of 426312301 is 103213624.
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 426312301 - 211 = 426310253 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 (426312311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54690 + ... + 61996.
It is an arithmetic number, because the mean of its divisors is an integer number (54634608).
Almost surely, 2426312301 is an apocalyptic number.
426312301 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
426312301 is a deficient number, since it is larger than the sum of its proper divisors (10764563).
426312301 is a wasteful number, since it uses less digits than its factorization.
426312301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8771.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 426312301 is about 20647.3315709319. The cubic root of 426312301 is about 752.6203460904.
Adding to 426312301 its reverse (103213624), we get a palindrome (529525925).
The spelling of 426312301 in words is "four hundred twenty-six million, three hundred twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •