Base | Representation |
---|---|
bin | 1001101001111111110001… |
… | …11110100111111101100111 |
3 | 2210011222011221110112220021 |
4 | 10310333320332213331213 |
5 | 10240400120312312221 |
6 | 113054505042220011 |
7 | 4321056166201345 |
oct | 464777076477547 |
9 | 83158157415807 |
10 | 21234200510311 |
11 | 6847412682788 |
12 | 246b3b6954607 |
13 | bb04b828a899 |
14 | 535a52a1a995 |
15 | 26c53c32b041 |
hex | 134ff8fa7f67 |
21234200510311 has 4 divisors (see below), whose sum is σ = 21295394172072. Its totient is φ = 21173006848552.
The previous prime is 21234200510269. The next prime is 21234200510357. The reversal of 21234200510311 is 11301500243212.
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 21234200510311 - 29 = 21234200509799 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21234200514311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30596830360 + ... + 30596831053.
It is an arithmetic number, because the mean of its divisors is an integer number (5323848543018).
Almost surely, 221234200510311 is an apocalyptic number.
21234200510311 is a deficient number, since it is larger than the sum of its proper divisors (61193661761).
21234200510311 is an equidigital number, since it uses as much as digits as its factorization.
21234200510311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61193661760.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 21234200510311 its reverse (11301500243212), we get a palindrome (32535700753523).
The spelling of 21234200510311 in words is "twenty-one trillion, two hundred thirty-four billion, two hundred million, five hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •