Base | Representation |
---|---|
bin | 1010001001111010101110… |
… | …11000111010100111000111 |
3 | 2221001211012212022111212212 |
4 | 11010331113120322213013 |
5 | 10411332342241334343 |
6 | 115254415325534035 |
7 | 4463235011442044 |
oct | 504752730724707 |
9 | 87054185274785 |
10 | 22331001121223 |
11 | 712a584a68363 |
12 | 2607a9311431b |
13 | c5ca5c27c402 |
14 | 572b7d2181cb |
15 | 28ad31e9ec18 |
hex | 144f5763a9c7 |
22331001121223 has 4 divisors (see below), whose sum is σ = 22339042536000. Its totient is φ = 22322959706448.
The previous prime is 22331001121213. The next prime is 22331001121243. The reversal of 22331001121223 is 32212110013322.
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 22331001121223 - 26 = 22331001121159 is a prime.
It is a super-2 number, since 2×223310011212232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22331001121213) 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, 4020703223 + ... + 4020708776.
It is an arithmetic number, because the mean of its divisors is an integer number (5584760634000).
Almost surely, 222331001121223 is an apocalyptic number.
22331001121223 is a deficient number, since it is larger than the sum of its proper divisors (8041414777).
22331001121223 is an equidigital number, since it uses as much as digits as its factorization.
22331001121223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8041414776.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 22331001121223 its reverse (32212110013322), we get a palindrome (54543111134545).
The spelling of 22331001121223 in words is "twenty-two trillion, three hundred thirty-one billion, one million, one hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •