Base | Representation |
---|---|
bin | 11001000010111… |
… | …100001100000111 |
3 | 1002021200102201021 |
4 | 121002330030013 |
5 | 1330032414343 |
6 | 105410212011 |
7 | 13261436311 |
oct | 3102741407 |
9 | 1067612637 |
10 | 420201223 |
11 | 1a6213442 |
12 | b8884007 |
13 | 690954a0 |
14 | 3db427b1 |
15 | 26d540ed |
hex | 190bc307 |
420201223 has 8 divisors (see below), whose sum is σ = 479143728. Its totient is φ = 365061504.
The previous prime is 420201163. The next prime is 420201239. The reversal of 420201223 is 322102024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-420201223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 420201197 and 420201206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420201253) 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, 950461 + ... + 950902.
It is an arithmetic number, because the mean of its divisors is an integer number (59892966).
Almost surely, 2420201223 is an apocalyptic number.
420201223 is a deficient number, since it is larger than the sum of its proper divisors (58942505).
420201223 is a wasteful number, since it uses less digits than its factorization.
420201223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1901393.
The product of its (nonzero) digits is 192, while the sum is 16.
The square root of 420201223 is about 20498.8102825505. The cubic root of 420201223 is about 749.0068175134.
Adding to 420201223 its reverse (322102024), we get a palindrome (742303247).
The spelling of 420201223 in words is "four hundred twenty million, two hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •