Base | Representation |
---|---|
bin | 1110100110110110000001… |
… | …10111100001101110011111 |
3 | 11012201201220210200111222202 |
4 | 13103123000313201232133 |
5 | 13202232302303033043 |
6 | 152152103444202115 |
7 | 6523444232324351 |
oct | 723330067415637 |
9 | 135651823614882 |
10 | 32121001221023 |
11 | a264492884150 |
12 | 372932239933b |
13 | 14bccc7434850 |
14 | 7d094412b0d1 |
15 | 3aa81aad01b8 |
hex | 1d36c0de1b9f |
32121001221023 has 16 divisors (see below), whose sum is σ = 37736770999200. Its totient is φ = 26954536250880.
The previous prime is 32121001220909. The next prime is 32121001221077. The reversal of 32121001221023 is 32012210012123.
It is a cyclic number.
It is not a de Polignac number, because 32121001221023 - 210 = 32121001219999 is a prime.
It is a super-2 number, since 2×321210012210232 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32121001220986 and 32121001221004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32121001226023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30567083 + ... + 31600451.
It is an arithmetic number, because the mean of its divisors is an integer number (2358548187450).
Almost surely, 232121001221023 is an apocalyptic number.
32121001221023 is a deficient number, since it is larger than the sum of its proper divisors (5615769778177).
32121001221023 is a wasteful number, since it uses less digits than its factorization.
32121001221023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1250762.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 32121001221023 its reverse (32012210012123), we get a palindrome (64133211233146).
The spelling of 32121001221023 in words is "thirty-two trillion, one hundred twenty-one billion, one million, two hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •