Base | Representation |
---|---|
bin | 10100001110110011000… |
… | …00010110010010010101 |
3 | 2110110021102102102120200 |
4 | 22013121200112102111 |
5 | 42342121022323141 |
6 | 1251201542251113 |
7 | 101136121623042 |
oct | 12073140262225 |
9 | 2413242372520 |
10 | 695138870421 |
11 | 248896852036 |
12 | b2880726a99 |
13 | 507223114c8 |
14 | 259058721c9 |
15 | 13137432ab6 |
hex | a1d9816495 |
695138870421 has 24 divisors (see below), whose sum is σ = 1011842694720. Its totient is φ = 459848126400.
The previous prime is 695138870411. The next prime is 695138870423. The reversal of 695138870421 is 124078831596.
695138870421 is a `hidden beast` number, since 6 + 9 + 5 + 138 + 87 + 0 + 421 = 666.
It is not a de Polignac number, because 695138870421 - 238 = 420260963477 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (695138870423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20213281 + ... + 20247641.
It is an arithmetic number, because the mean of its divisors is an integer number (42160112280).
It is a 1-persistent number, because it is pandigital, but 2⋅695138870421 = 1390277740842 is not.
Almost surely, 2695138870421 is an apocalyptic number.
It is an amenable number.
695138870421 is a deficient number, since it is larger than the sum of its proper divisors (316703824299).
695138870421 is a wasteful number, since it uses less digits than its factorization.
695138870421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51657 (or 51654 counting only the distinct ones).
The product of its (nonzero) digits is 2903040, while the sum is 54.
The spelling of 695138870421 in words is "six hundred ninety-five billion, one hundred thirty-eight million, eight hundred seventy thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •