Base | Representation |
---|---|
bin | 1001100100000011101010… |
… | …00001100000010111101111 |
3 | 2202110110102110000120011111 |
4 | 10302001311001200113233 |
5 | 10224024143020211343 |
6 | 112421034421332451 |
7 | 4300243025601151 |
oct | 462016501402757 |
9 | 82413373016144 |
10 | 21030123210223 |
11 | 6778909330696 |
12 | 2437941867127 |
13 | b9719432380a |
14 | 529c13222ad1 |
15 | 267095e62c9d |
hex | 1320750605ef |
21030123210223 has 4 divisors (see below), whose sum is σ = 21054605310280. Its totient is φ = 21005641110168.
The previous prime is 21030123210221. The next prime is 21030123210263. The reversal of 21030123210223 is 32201232103012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21030123210223 - 21 = 21030123210221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21030123210194 and 21030123210203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21030123210221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12241048740 + ... + 12241050457.
It is an arithmetic number, because the mean of its divisors is an integer number (5263651327570).
Almost surely, 221030123210223 is an apocalyptic number.
21030123210223 is a deficient number, since it is larger than the sum of its proper divisors (24482100057).
21030123210223 is an equidigital number, since it uses as much as digits as its factorization.
21030123210223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24482100056.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 21030123210223 its reverse (32201232103012), we get a palindrome (53231355313235).
The spelling of 21030123210223 in words is "twenty-one trillion, thirty billion, one hundred twenty-three million, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •