Base | Representation |
---|---|
bin | 1001100011010001100000… |
… | …11101001011100011110101 |
3 | 2202100212221022221212211222 |
4 | 10301220300131023203311 |
5 | 10223104024434031313 |
6 | 112400423244440125 |
7 | 4265300644063343 |
oct | 461506035134365 |
9 | 82325838855758 |
10 | 21003203033333 |
11 | 6768454618314 |
12 | 243268a249045 |
13 | b94794040971 |
14 | 5287bbc3c993 |
15 | 26651c8e9208 |
hex | 131a3074b8f5 |
21003203033333 has 2 divisors, whose sum is σ = 21003203033334. Its totient is φ = 21003203033332.
The previous prime is 21003203033227. The next prime is 21003203033357. The reversal of 21003203033333 is 33333030230012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20900047725649 + 103155307684 = 4571657^2 + 321178^2 .
It is a cyclic number.
It is not a de Polignac number, because 21003203033333 - 214 = 21003203016949 is a prime.
It is a super-2 number, since 2×210032030333332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21003203033633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10501601516666 + 10501601516667.
It is an arithmetic number, because the mean of its divisors is an integer number (10501601516667).
Almost surely, 221003203033333 is an apocalyptic number.
It is an amenable number.
21003203033333 is a deficient number, since it is larger than the sum of its proper divisors (1).
21003203033333 is an equidigital number, since it uses as much as digits as its factorization.
21003203033333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 26.
Adding to 21003203033333 its reverse (33333030230012), we get a palindrome (54336233263345).
The spelling of 21003203033333 in words is "twenty-one trillion, three billion, two hundred three million, thirty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •