Base | Representation |
---|---|
bin | 100001110001101110001… |
… | …001000110111000101111 |
3 | 22012220020120000022211210 |
4 | 201301232021012320233 |
5 | 301012133314033403 |
6 | 4534151300045503 |
7 | 326460525226521 |
oct | 41615611067057 |
9 | 8186216008753 |
10 | 2321130221103 |
11 | 815427552a31 |
12 | 315a25993893 |
13 | 13ab5cc70095 |
14 | 804b4041a11 |
15 | 405a075cb03 |
hex | 21c6e246e2f |
2321130221103 has 16 divisors (see below), whose sum is σ = 3178646102016. Its totient is φ = 1505521493280.
The previous prime is 2321130221087. The next prime is 2321130221167. The reversal of 2321130221103 is 3011220311232.
2321130221103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2321130221103 - 24 = 2321130221087 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2321130221103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2321130221903) 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, 1705858 + ... + 2748128.
It is an arithmetic number, because the mean of its divisors is an integer number (198665381376).
Almost surely, 22321130221103 is an apocalyptic number.
2321130221103 is a deficient number, since it is larger than the sum of its proper divisors (857515880913).
2321130221103 is a wasteful number, since it uses less digits than its factorization.
2321130221103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1062374.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 2321130221103 its reverse (3011220311232), we get a palindrome (5332350532335).
The spelling of 2321130221103 in words is "two trillion, three hundred twenty-one billion, one hundred thirty million, two hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •