Base | Representation |
---|---|
bin | 1100001110010101001… |
… | …11001110111010000110 |
3 | 1111011010022000002022212 |
4 | 12013022213032322012 |
5 | 23340140321010042 |
6 | 520541143423422 |
7 | 42226160346440 |
oct | 6071247167206 |
9 | 1434108002285 |
10 | 420011110022 |
11 | 15214235a559 |
12 | 69498a54b72 |
13 | 307b7405b4a |
14 | 16485b3b490 |
15 | add360b482 |
hex | 61ca9cee86 |
420011110022 has 8 divisors (see below), whose sum is σ = 720019045776. Its totient is φ = 180004761432.
The previous prime is 420011110009. The next prime is 420011110061. The reversal of 420011110022 is 220011110024.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×4200111100223 (a number of 36 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 30000793573 = 420011110022 / (4 + 2 + 0 + 0 + 1 + 1 + 1 + 1 + 0 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 420011109979 and 420011110006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15000396773 + ... + 15000396800.
It is an arithmetic number, because the mean of its divisors is an integer number (90002380722).
Almost surely, 2420011110022 is an apocalyptic number.
420011110022 is a deficient number, since it is larger than the sum of its proper divisors (300007935754).
420011110022 is a wasteful number, since it uses less digits than its factorization.
420011110022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30000793582.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 420011110022 its reverse (220011110024), we get a palindrome (640022220046).
The spelling of 420011110022 in words is "four hundred twenty billion, eleven million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •