Base | Representation |
---|---|
bin | 1011000111010100001111… |
… | …1110001011010110100111 |
3 | 1121021020210021102010012121 |
4 | 2301311003332023112213 |
5 | 3100204210004030043 |
6 | 41553534422130411 |
7 | 2400613656635053 |
oct | 261650376132647 |
9 | 47236707363177 |
10 | 12220322330023 |
11 | 3991678410375 |
12 | 1454469280a07 |
13 | 6a84aa1022c2 |
14 | 303676accc63 |
15 | 162d2a580ded |
hex | b1d43f8b5a7 |
12220322330023 has 4 divisors (see below), whose sum is σ = 12220335393480. Its totient is φ = 12220309266568.
The previous prime is 12220322330003. The next prime is 12220322330033. The reversal of 12220322330023 is 32003322302221.
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 12220322330023 - 29 = 12220322329511 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 12220322330023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12220322330003) 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, 5010433 + ... + 7038826.
It is an arithmetic number, because the mean of its divisors is an integer number (3055083848370).
Almost surely, 212220322330023 is an apocalyptic number.
12220322330023 is a deficient number, since it is larger than the sum of its proper divisors (13063457).
12220322330023 is a wasteful number, since it uses less digits than its factorization.
12220322330023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13063456.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 12220322330023 its reverse (32003322302221), we get a palindrome (44223644632244).
The spelling of 12220322330023 in words is "twelve trillion, two hundred twenty billion, three hundred twenty-two million, three hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •