Base | Representation |
---|---|
bin | 111110101001110… |
… | …1000111010100001 |
3 | 12102111211220212212 |
4 | 1331103220322201 |
5 | 13301142102241 |
6 | 544335331505 |
7 | 103045154312 |
oct | 17523507241 |
9 | 5374756785 |
10 | 2102300321 |
11 | 98976a390 |
12 | 4a8080b95 |
13 | 276714bb4 |
14 | 15d2c8609 |
15 | c486dbeb |
hex | 7d4e8ea1 |
2102300321 has 8 divisors (see below), whose sum is σ = 2298648000. Its totient is φ = 1906824240.
The previous prime is 2102300311. The next prime is 2102300327. The reversal of 2102300321 is 1230032012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2102300321 - 218 = 2102038177 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2102300296 and 2102300305.
It is not an unprimeable number, because it can be changed into a prime (2102300327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 212846 + ... + 222503.
It is an arithmetic number, because the mean of its divisors is an integer number (287331000).
Almost surely, 22102300321 is an apocalyptic number.
It is an amenable number.
2102300321 is a deficient number, since it is larger than the sum of its proper divisors (196347679).
2102300321 is a wasteful number, since it uses less digits than its factorization.
2102300321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435799.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 2102300321 is about 45850.8486399107. The cubic root of 2102300321 is about 1281.0465726414.
Adding to 2102300321 its reverse (1230032012), we get a palindrome (3332332333).
The spelling of 2102300321 in words is "two billion, one hundred two million, three hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •