Base | Representation |
---|---|
bin | 11001001111100… |
… | …010110110110011 |
3 | 1002111220022002122 |
4 | 121033202312303 |
5 | 1331404132311 |
6 | 110005104455 |
7 | 13331510264 |
oct | 3117426663 |
9 | 1074808078 |
10 | 423505331 |
11 | 1a806a907 |
12 | b99b812b |
13 | 69981392 |
14 | 4036296b |
15 | 272a80db |
hex | 193e2db3 |
423505331 has 4 divisors (see below), whose sum is σ = 424449000. Its totient is φ = 422561664.
The previous prime is 423505301. The next prime is 423505337. The reversal of 423505331 is 133505324.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 423505331 - 26 = 423505267 is a prime.
It is a super-2 number, since 2×4235053312 = 358713530770839122, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 423505331.
It is not an unprimeable number, because it can be changed into a prime (423505337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 471161 + ... + 472058.
It is an arithmetic number, because the mean of its divisors is an integer number (106112250).
Almost surely, 2423505331 is an apocalyptic number.
423505331 is a deficient number, since it is larger than the sum of its proper divisors (943669).
423505331 is an equidigital number, since it uses as much as digits as its factorization.
423505331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 943668.
The product of its (nonzero) digits is 5400, while the sum is 26.
The square root of 423505331 is about 20579.2451513655. The cubic root of 423505331 is about 750.9648802166.
The spelling of 423505331 in words is "four hundred twenty-three million, five hundred five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •