Base | Representation |
---|---|
bin | 1001100011001100001010… |
… | …01110101010110011110011 |
3 | 2202100121112010110012011202 |
4 | 10301212011032222303303 |
5 | 10223032134030401420 |
6 | 112355230224401415 |
7 | 4265136522342152 |
oct | 461460516526363 |
9 | 82317463405152 |
10 | 21000330325235 |
11 | 676720aa9a198 |
12 | 243200817626b |
13 | b94426b373a1 |
14 | 5285c84cd599 |
15 | 2664005eb575 |
hex | 1319853aacf3 |
21000330325235 has 4 divisors (see below), whose sum is σ = 25200396390288. Its totient is φ = 16800264260184.
The previous prime is 21000330325223. The next prime is 21000330325243. The reversal of 21000330325235 is 53252303300012.
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 21000330325235 - 26 = 21000330325171 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21000330325198 and 21000330325207.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2100033032519 + ... + 2100033032528.
It is an arithmetic number, because the mean of its divisors is an integer number (6300099097572).
Almost surely, 221000330325235 is an apocalyptic number.
21000330325235 is a deficient number, since it is larger than the sum of its proper divisors (4200066065053).
21000330325235 is an equidigital number, since it uses as much as digits as its factorization.
21000330325235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4200066065052.
The product of its (nonzero) digits is 16200, while the sum is 29.
Adding to 21000330325235 its reverse (53252303300012), we get a palindrome (74252633625247).
The spelling of 21000330325235 in words is "twenty-one trillion, three hundred thirty million, three hundred twenty-five thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •