Base | Representation |
---|---|
bin | 1110101001101110100111… |
… | …00111011101001011101111 |
3 | 11020002012201011120020222202 |
4 | 13110313103213131023233 |
5 | 13210343231101214043 |
6 | 152305413135332115 |
7 | 6533553054254423 |
oct | 724672347351357 |
9 | 136065634506882 |
10 | 32220100023023 |
11 | a2a2516539910 |
12 | 374457a38103b |
13 | 14c945b31b523 |
14 | 7d56655dcb83 |
15 | 3ad1bab531b8 |
hex | 1d4dd39dd2ef |
32220100023023 has 32 divisors (see below), whose sum is σ = 36135846254592. Its totient is φ = 28480739839200.
The previous prime is 32220100022963. The next prime is 32220100023049. The reversal of 32220100023023 is 32032000102223.
It is not a de Polignac number, because 32220100023023 - 28 = 32220100022767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32220100022986 and 32220100023004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32220100023073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68460518 + ... + 68929548.
It is an arithmetic number, because the mean of its divisors is an integer number (1129245195456).
Almost surely, 232220100023023 is an apocalyptic number.
32220100023023 is a deficient number, since it is larger than the sum of its proper divisors (3915746231569).
32220100023023 is a wasteful number, since it uses less digits than its factorization.
32220100023023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470315.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 32220100023023 its reverse (32032000102223), we get a palindrome (64252100125246).
The spelling of 32220100023023 in words is "thirty-two trillion, two hundred twenty billion, one hundred million, twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •