Base | Representation |
---|---|
bin | 1010000000010100011011… |
… | …11001110100000011111111 |
3 | 2212220021221200101221000212 |
4 | 11000022031321310003333 |
5 | 10340431431011424043 |
6 | 114443114020343035 |
7 | 4430351216601650 |
oct | 500121571640377 |
9 | 85807850357025 |
10 | 22001203233023 |
11 | 7012726722683 |
12 | 2573b92544a7b |
13 | c37920c01cc1 |
14 | 560c1483d527 |
15 | 28247d7dc018 |
hex | 14028de740ff |
22001203233023 has 8 divisors (see below), whose sum is σ = 25156385125920. Its totient is φ = 18849059555040.
The previous prime is 22001203232999. The next prime is 22001203233127. The reversal of 22001203233023 is 32033230210022.
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 22001203233023 - 230 = 22000129491199 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22001203233023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22001203239023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 759538208 + ... + 759567173.
It is an arithmetic number, because the mean of its divisors is an integer number (3144548140740).
Almost surely, 222001203233023 is an apocalyptic number.
22001203233023 is a deficient number, since it is larger than the sum of its proper divisors (3155181892897).
22001203233023 is a wasteful number, since it uses less digits than its factorization.
22001203233023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1519107457.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 22001203233023 its reverse (32033230210022), we get a palindrome (54034433443045).
The spelling of 22001203233023 in words is "twenty-two trillion, one billion, two hundred three million, two hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •