Base | Representation |
---|---|
bin | 10011110000010110… |
… | …100000100000010101 |
3 | 2000202022200120001010 |
4 | 103300112200200111 |
5 | 321420322120313 |
6 | 13424513122433 |
7 | 1350442405056 |
oct | 236026404025 |
9 | 60668616033 |
10 | 21212301333 |
11 | 8aa5877a53 |
12 | 413bb59419 |
13 | 20008b82c2 |
14 | 10532d872d |
15 | 8423d64c3 |
hex | 4f05a0815 |
21212301333 has 8 divisors (see below), whose sum is σ = 29512767168. Its totient is φ = 13526684864.
The previous prime is 21212301289. The next prime is 21212301389. The reversal of 21212301333 is 33310321212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21212301333 - 26 = 21212301269 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21212301433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 153712260 + ... + 153712397.
It is an arithmetic number, because the mean of its divisors is an integer number (3689095896).
Almost surely, 221212301333 is an apocalyptic number.
21212301333 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
21212301333 is a deficient number, since it is larger than the sum of its proper divisors (8300465835).
21212301333 is a wasteful number, since it uses less digits than its factorization.
21212301333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307424683.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 21212301333 its reverse (33310321212), we get a palindrome (54522622545).
The spelling of 21212301333 in words is "twenty-one billion, two hundred twelve million, three hundred one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •