Base | Representation |
---|---|
bin | 11001000101000… |
… | …110001111100111 |
3 | 1002022202011101200 |
4 | 121011012033213 |
5 | 1330204013240 |
6 | 105430253543 |
7 | 13266313026 |
oct | 3105061747 |
9 | 1068664350 |
10 | 420766695 |
11 | 1a656a278 |
12 | b8ab72b3 |
13 | 6923299b |
14 | 3dc4c8bd |
15 | 26e16930 |
hex | 191463e7 |
420766695 has 24 divisors (see below), whose sum is σ = 729807936. Its totient is φ = 224261568.
The previous prime is 420766691. The next prime is 420766721. The reversal of 420766695 is 596667024.
It is not a de Polignac number, because 420766695 - 22 = 420766691 is a prime.
It is a super-2 number, since 2×4207666952 = 354089223242446050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 420766695.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420766691) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 124194 + ... + 127536.
It is an arithmetic number, because the mean of its divisors is an integer number (30408664).
Almost surely, 2420766695 is an apocalyptic number.
420766695 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
420766695 is a deficient number, since it is larger than the sum of its proper divisors (309041241).
420766695 is a wasteful number, since it uses less digits than its factorization.
420766695 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6151 (or 6148 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 45.
The square root of 420766695 is about 20512.5984458332. The cubic root of 420766695 is about 749.3426506908.
The spelling of 420766695 in words is "four hundred twenty million, seven hundred sixty-six thousand, six hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •