Base | Representation |
---|---|
bin | 11001000111010… |
… | …110000111110111 |
3 | 1002100212002210122 |
4 | 121013112013313 |
5 | 1330331343043 |
6 | 105451042155 |
7 | 13304316134 |
oct | 3107260767 |
9 | 1070762718 |
10 | 421356023 |
11 | 1a6932020 |
12 | b914035b |
13 | 693aacba |
14 | 3dd6358b |
15 | 26ed1368 |
hex | 191d61f7 |
421356023 has 4 divisors (see below), whose sum is σ = 459661128. Its totient is φ = 383050920.
The previous prime is 421356017. The next prime is 421356029. The reversal of 421356023 is 320653124.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (421356017) and next prime (421356029).
It is a cyclic number.
It is not a de Polignac number, because 421356023 - 218 = 421093879 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 421355983 and 421356001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421356029) 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, 19152536 + ... + 19152557.
It is an arithmetic number, because the mean of its divisors is an integer number (114915282).
Almost surely, 2421356023 is an apocalyptic number.
421356023 is a deficient number, since it is larger than the sum of its proper divisors (38305105).
421356023 is a wasteful number, since it uses less digits than its factorization.
421356023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38305104.
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 421356023 is about 20526.9584449328. The cubic root of 421356023 is about 749.6923318784.
The spelling of 421356023 in words is "four hundred twenty-one million, three hundred fifty-six thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •