Base | Representation |
---|---|
bin | 1001101001011000111110… |
… | …00000010100101011000001 |
3 | 2210002222101210020112122220 |
4 | 10310230133000110223001 |
5 | 10240024432043401223 |
6 | 113041141300121253 |
7 | 4316420632633206 |
oct | 464543700245301 |
9 | 83088353215586 |
10 | 21213363653313 |
11 | 683959a829707 |
12 | 2467360696229 |
13 | bab5473c6cc0 |
14 | 534a37533cad |
15 | 26bc1cda76e3 |
hex | 134b1f014ac1 |
21213363653313 has 8 divisors (see below), whose sum is σ = 30460214476608. Its totient is φ = 13054377632784.
The previous prime is 21213363653269. The next prime is 21213363653353. The reversal of 21213363653313 is 31335636331212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21213363653313 - 213 = 21213363645121 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21213363653353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 271966200645 + ... + 271966200722.
It is an arithmetic number, because the mean of its divisors is an integer number (3807526809576).
Almost surely, 221213363653313 is an apocalyptic number.
It is an amenable number.
21213363653313 is a deficient number, since it is larger than the sum of its proper divisors (9246850823295).
21213363653313 is a wasteful number, since it uses less digits than its factorization.
21213363653313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 543932401383.
The product of its digits is 524880, while the sum is 42.
Adding to 21213363653313 its reverse (31335636331212), we get a palindrome (52548999984525).
The spelling of 21213363653313 in words is "twenty-one trillion, two hundred thirteen billion, three hundred sixty-three million, six hundred fifty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •