Base | Representation |
---|---|
bin | 1001101110011001111011… |
… | …01011111001011011101011 |
3 | 2210201110011121100210121212 |
4 | 10313030331223321123223 |
5 | 10300340331313200040 |
6 | 113252235555023335 |
7 | 4335031004632331 |
oct | 467147553713353 |
9 | 83643147323555 |
10 | 21385677084395 |
11 | 68a5684210898 |
12 | 249482bb9ab4b |
13 | bc1878719700 |
14 | 53d102533b51 |
15 | 271455878d65 |
hex | 13733daf96eb |
21385677084395 has 96 divisors (see below), whose sum is σ = 28487743587072. Its totient is φ = 15399235178496.
The previous prime is 21385677084391. The next prime is 21385677084407. The reversal of 21385677084395 is 59348077658312.
It is not a de Polignac number, because 21385677084395 - 22 = 21385677084391 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21385677084391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 5144495657 + ... + 5144499813.
It is an arithmetic number, because the mean of its divisors is an integer number (296747329032).
It is a 2-persistent number, because it is pandigital, and so is 2⋅21385677084395 = 42771354168790, but 3⋅21385677084395 = 64157031253185 is not.
Almost surely, 221385677084395 is an apocalyptic number.
21385677084395 is a deficient number, since it is larger than the sum of its proper divisors (7102066502677).
21385677084395 is a wasteful number, since it uses less digits than its factorization.
21385677084395 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4921 (or 4908 counting only the distinct ones).
The product of its (nonzero) digits is 304819200, while the sum is 68.
The spelling of 21385677084395 in words is "twenty-one trillion, three hundred eighty-five billion, six hundred seventy-seven million, eighty-four thousand, three hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •