Base | Representation |
---|---|
bin | 1110101001001001100110… |
… | …10010100011011110010111 |
3 | 11020000022102102012202121211 |
4 | 13110210303102203132113 |
5 | 13210032032430220043 |
6 | 152252325342522251 |
7 | 6532250503466233 |
oct | 724446322433627 |
9 | 136008372182554 |
10 | 32200230320023 |
11 | a29504a614967 |
12 | 3740753b96387 |
13 | 14c761293460c |
14 | 7d46dc7535c3 |
15 | 3ac906573a9d |
hex | 1d49334a3797 |
32200230320023 has 4 divisors (see below), whose sum is σ = 32202231966640. Its totient is φ = 32198228673408.
The previous prime is 32200230319997. The next prime is 32200230320029. The reversal of 32200230320023 is 32002303200223.
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 32200230320023 - 25 = 32200230319991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32200230319976 and 32200230320003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32200230320029) 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, 1000799178 + ... + 1000831351.
It is an arithmetic number, because the mean of its divisors is an integer number (8050557991660).
Almost surely, 232200230320023 is an apocalyptic number.
32200230320023 is a deficient number, since it is larger than the sum of its proper divisors (2001646617).
32200230320023 is a wasteful number, since it uses less digits than its factorization.
32200230320023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2001646616.
The product of its (nonzero) digits is 2592, while the sum is 22.
Adding to 32200230320023 its reverse (32002303200223), we get a palindrome (64202533520246).
The spelling of 32200230320023 in words is "thirty-two trillion, two hundred billion, two hundred thirty million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •