Base | Representation |
---|---|
bin | 1010000100000110111111… |
… | …01011100011001010111011 |
3 | 2220100202002000012201021122 |
4 | 11002003133223203022323 |
5 | 10400100124101310121 |
6 | 115023011432455455 |
7 | 4442641216124246 |
oct | 502033753431273 |
9 | 86322060181248 |
10 | 22131424244411 |
11 | 7062980025949 |
12 | 259527524a58b |
13 | c46ca48096b1 |
14 | 5672493da25d |
15 | 285a50c5a5ab |
hex | 1420dfae32bb |
22131424244411 has 4 divisors (see below), whose sum is σ = 22131441374952. Its totient is φ = 22131407113872.
The previous prime is 22131424244359. The next prime is 22131424244459. The reversal of 22131424244411 is 11444242413122.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22131424244411 - 214 = 22131424228027 is a prime.
It is a super-2 number, since 2×221314242444112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22131424241411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6453890 + ... + 9269063.
It is an arithmetic number, because the mean of its divisors is an integer number (5532860343738).
Almost surely, 222131424244411 is an apocalyptic number.
22131424244411 is a deficient number, since it is larger than the sum of its proper divisors (17130541).
22131424244411 is a wasteful number, since it uses less digits than its factorization.
22131424244411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17130540.
The product of its digits is 49152, while the sum is 35.
Adding to 22131424244411 its reverse (11444242413122), we get a palindrome (33575666657533).
The spelling of 22131424244411 in words is "twenty-two trillion, one hundred thirty-one billion, four hundred twenty-four million, two hundred forty-four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.184 sec. • engine limits •