Base | Representation |
---|---|
bin | 1001100100000100000001… |
… | …11100100100000101010111 |
3 | 2202110110221101102012020000 |
4 | 10302002000330210011113 |
5 | 10224030100222210203 |
6 | 112421110324542343 |
7 | 4300251005045145 |
oct | 462020074440527 |
9 | 82413841365200 |
10 | 21030323241303 |
11 | 6778a01234a32 |
12 | 24379988519b3 |
13 | b971c68bbcbc |
14 | 529c31a12595 |
15 | 2670a87c64a3 |
hex | 132080f24157 |
21030323241303 has 40 divisors (see below), whose sum is σ = 32885824536576. Its totient is φ = 13376852470800.
The previous prime is 21030323241289. The next prime is 21030323241331. The reversal of 21030323241303 is 30314232303012.
21030323241303 is a `hidden beast` number, since 2 + 1 + 0 + 3 + 0 + 32 + 324 + 1 + 303 = 666.
It is not a de Polignac number, because 21030323241303 - 213 = 21030323233111 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21030323241353) 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 39 ways as a sum of consecutive naturals, for example, 58802551 + ... + 59159112.
Almost surely, 221030323241303 is an apocalyptic number.
21030323241303 is a deficient number, since it is larger than the sum of its proper divisors (11855501295273).
21030323241303 is a wasteful number, since it uses less digits than its factorization.
21030323241303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117961777 (or 117961768 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 27.
Adding to 21030323241303 its reverse (30314232303012), we get a palindrome (51344555544315).
The spelling of 21030323241303 in words is "twenty-one trillion, thirty billion, three hundred twenty-three million, two hundred forty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •