Base | Representation |
---|---|
bin | 10011101011101000… |
… | …111101111011010001 |
3 | 2000112210221112222012 |
4 | 103223220331323101 |
5 | 321240103114403 |
6 | 13413010552305 |
7 | 1345462461311 |
oct | 235350757321 |
9 | 60483845865 |
10 | 21133254353 |
11 | 8a65197872 |
12 | 4119598695 |
13 | 1cba3cc943 |
14 | 10469dd441 |
15 | 83a4beed8 |
hex | 4eba3ded1 |
21133254353 has 4 divisors (see below), whose sum is σ = 22376386980. Its totient is φ = 19890121728.
The previous prime is 21133254343. The next prime is 21133254367. The reversal of 21133254353 is 35345233112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10922758144 + 10210496209 = 104512^2 + 101047^2 .
It is a cyclic number.
It is not a de Polignac number, because 21133254353 - 28 = 21133254097 is a prime.
It is a super-2 number, since 2×211332543532 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (21133254313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 621566288 + ... + 621566321.
It is an arithmetic number, because the mean of its divisors is an integer number (5594096745).
Almost surely, 221133254353 is an apocalyptic number.
It is an amenable number.
21133254353 is a deficient number, since it is larger than the sum of its proper divisors (1243132627).
21133254353 is a wasteful number, since it uses less digits than its factorization.
21133254353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1243132626.
The product of its digits is 32400, while the sum is 32.
Adding to 21133254353 its reverse (35345233112), we get a palindrome (56478487465).
The spelling of 21133254353 in words is "twenty-one billion, one hundred thirty-three million, two hundred fifty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •