Base | Representation |
---|---|
bin | 1001101001010011010000… |
… | …11010100100011010101111 |
3 | 2210002200111022000020001202 |
4 | 10310221220122210122233 |
5 | 10240002143334144043 |
6 | 113035513310000115 |
7 | 4316252004610616 |
oct | 464515032443257 |
9 | 83080438006052 |
10 | 21210300303023 |
11 | 683826862a257 |
12 | 24668467a603b |
13 | bab1798618b0 |
14 | 53482675a87d |
15 | 26badde9d1b8 |
hex | 134a686a46af |
21210300303023 has 8 divisors (see below), whose sum is σ = 22885536560208. Its totient is φ = 19541303288064.
The previous prime is 21210300303001. The next prime is 21210300303041. The reversal of 21210300303023 is 32030300301212.
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 21210300303023 - 28 = 21210300302767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21210300302986 and 21210300303004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21210300353023) 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, 1559803490 + ... + 1559817087.
It is an arithmetic number, because the mean of its divisors is an integer number (2860692070026).
Almost surely, 221210300303023 is an apocalyptic number.
21210300303023 is a deficient number, since it is larger than the sum of its proper divisors (1675236257185).
21210300303023 is a wasteful number, since it uses less digits than its factorization.
21210300303023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3119621113.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 21210300303023 its reverse (32030300301212), we get a palindrome (53240600604235).
The spelling of 21210300303023 in words is "twenty-one trillion, two hundred ten billion, three hundred million, three hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •