Base | Representation |
---|---|
bin | 1010000111010101011001… |
… | …11000000101001001111111 |
3 | 2220202100010000120020222002 |
4 | 11003222230320011021333 |
5 | 10403404102201303043 |
6 | 115145540001212515 |
7 | 4453643316266033 |
oct | 503525470051177 |
9 | 86670100506862 |
10 | 22242241041023 |
11 | 70a5977239383 |
12 | 25b284163113b |
13 | c545852ba7b3 |
14 | 56c75cc7c1c3 |
15 | 2888898e6bb8 |
hex | 143aace0527f |
22242241041023 has 8 divisors (see below), whose sum is σ = 23421963638400. Its totient is φ = 21063426276888.
The previous prime is 22242241041011. The next prime is 22242241041043. The reversal of 22242241041023 is 32014014224222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22242241041023 - 226 = 22242173932159 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22242241041043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 226908011 + ... + 227006012.
It is an arithmetic number, because the mean of its divisors is an integer number (2927745454800).
Almost surely, 222242241041023 is an apocalyptic number.
22242241041023 is a deficient number, since it is larger than the sum of its proper divisors (1179722597377).
22242241041023 is a wasteful number, since it uses less digits than its factorization.
22242241041023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 453916621.
The product of its (nonzero) digits is 12288, while the sum is 29.
Adding to 22242241041023 its reverse (32014014224222), we get a palindrome (54256255265245).
The spelling of 22242241041023 in words is "twenty-two trillion, two hundred forty-two billion, two hundred forty-one million, forty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •