Base | Representation |
---|---|
bin | 1010000000111010011100… |
… | …00000100110010100111001 |
3 | 2212222020121121000021200201 |
4 | 11000131032000212110321 |
5 | 10341300222130401200 |
6 | 114500330341002201 |
7 | 4432002633265612 |
oct | 500351600462471 |
9 | 85866547007621 |
10 | 22021606106425 |
11 | 70203465aa422 |
12 | 2577b273b3361 |
13 | c39822bb6063 |
14 | 561bcc436c09 |
15 | 282c74ad7c6a |
hex | 14074e026539 |
22021606106425 has 24 divisors (see below), whose sum is σ = 27891134246016. Its totient is φ = 17240379589440.
The previous prime is 22021606106393. The next prime is 22021606106459. The reversal of 22021606106425 is 52460160612022.
It is a happy number.
It is not a de Polignac number, because 22021606106425 - 25 = 22021606106393 is a prime.
It is a super-2 number, since 2×220216061064252 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8706007 + ... + 10947043.
It is an arithmetic number, because the mean of its divisors is an integer number (1162130593584).
Almost surely, 222021606106425 is an apocalyptic number.
22021606106425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
22021606106425 is a deficient number, since it is larger than the sum of its proper divisors (5869528139591).
22021606106425 is a wasteful number, since it uses less digits than its factorization.
22021606106425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2249457 (or 2249452 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 37.
Adding to 22021606106425 its reverse (52460160612022), we get a palindrome (74481766718447).
The spelling of 22021606106425 in words is "twenty-two trillion, twenty-one billion, six hundred six million, one hundred six thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •