Base | Representation |
---|---|
bin | 1001101001011001010011… |
… | …10000110001100010101011 |
3 | 2210002222212100211112112000 |
4 | 10310230221300301202223 |
5 | 10240030314244023020 |
6 | 113041211224222043 |
7 | 4316425253632410 |
oct | 464545160614253 |
9 | 83088770745460 |
10 | 21213544126635 |
11 | 6839682694a13 |
12 | 24673b100a923 |
13 | bab575905453 |
14 | 534a534b2107 |
15 | 26bc2db56090 |
hex | 134b29c318ab |
21213544126635 has 64 divisors (see below), whose sum is σ = 43101115545600. Its totient is φ = 9697489347456.
The previous prime is 21213544126573. The next prime is 21213544126657. The reversal of 21213544126635 is 53662144531212.
21213544126635 is a `hidden beast` number, since 2 + 1 + 2 + 1 + 3 + 5 + 4 + 4 + 1 + 2 + 6 + 635 = 666.
It is not a de Polignac number, because 21213544126635 - 212 = 21213544122539 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 122316361 + ... + 122489669.
It is an arithmetic number, because the mean of its divisors is an integer number (673454930400).
Almost surely, 221213544126635 is an apocalyptic number.
21213544126635 is an abundant number, since it is smaller than the sum of its proper divisors (21887571418965).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21213544126635 is a wasteful number, since it uses less digits than its factorization.
21213544126635 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302857 (or 302851 counting only the distinct ones).
The product of its digits is 1036800, while the sum is 45.
Adding to 21213544126635 its reverse (53662144531212), we get a palindrome (74875688657847).
The spelling of 21213544126635 in words is "twenty-one trillion, two hundred thirteen billion, five hundred forty-four million, one hundred twenty-six thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •