Base | Representation |
---|---|
bin | 1110100110110110011001… |
… | …10110001111100100011111 |
3 | 11012201202102210212212112210 |
4 | 13103123030312033210133 |
5 | 13202233210231223403 |
6 | 152152135424131503 |
7 | 6523452222604305 |
oct | 723331466174437 |
9 | 135652383785483 |
10 | 32121202211103 |
11 | a264586282a55 |
12 | 3729379766b93 |
13 | 14c0029c776a5 |
14 | 7d0962aca275 |
15 | 3aa82d582b03 |
hex | 1d36ccd8f91f |
32121202211103 has 8 divisors (see below), whose sum is σ = 42837823116928. Its totient is φ = 21409358056344.
The previous prime is 32121202211099. The next prime is 32121202211143. The reversal of 32121202211103 is 30111220212123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32121202211103 - 22 = 32121202211099 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 32121202211103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32121202211143) 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, 1194172075 + ... + 1194198972.
It is an arithmetic number, because the mean of its divisors is an integer number (5354727889616).
Almost surely, 232121202211103 is an apocalyptic number.
32121202211103 is a deficient number, since it is larger than the sum of its proper divisors (10716620905825).
32121202211103 is a wasteful number, since it uses less digits than its factorization.
32121202211103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2388375533.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 32121202211103 its reverse (30111220212123), we get a palindrome (62232422423226).
The spelling of 32121202211103 in words is "thirty-two trillion, one hundred twenty-one billion, two hundred two million, two hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •