Base | Representation |
---|---|
bin | 11001001111100… |
… | …010110010000111 |
3 | 1002111220021200112 |
4 | 121033202302013 |
5 | 1331404130111 |
6 | 110005103235 |
7 | 13331506355 |
oct | 3117426207 |
9 | 1074807615 |
10 | 423505031 |
11 | 1a806a664 |
12 | b99b7b1b |
13 | 699811c1 |
14 | 403627d5 |
15 | 272a7e8b |
hex | 193e2c87 |
423505031 has 8 divisors (see below), whose sum is σ = 434254128. Its totient is φ = 412776000.
The previous prime is 423505001. The next prime is 423505073. The reversal of 423505031 is 130505324.
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 423505031 - 26 = 423504967 is a prime.
It is a super-2 number, since 2×4235050312 = 358713022564621922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 423504988 and 423505006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (423505001) 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, 43601 + ... + 52421.
It is an arithmetic number, because the mean of its divisors is an integer number (54281766).
Almost surely, 2423505031 is an apocalyptic number.
423505031 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
423505031 is a deficient number, since it is larger than the sum of its proper divisors (10749097).
423505031 is a wasteful number, since it uses less digits than its factorization.
423505031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10033.
The product of its (nonzero) digits is 1800, while the sum is 23.
The square root of 423505031 is about 20579.2378624671. The cubic root of 423505031 is about 750.9647028954.
The spelling of 423505031 in words is "four hundred twenty-three million, five hundred five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.963 sec. • engine limits •