Base | Representation |
---|---|
bin | 11001011100010000100… |
… | …10001010111110011101 |
3 | 10002120101001100021002112 |
4 | 30232020102022332131 |
5 | 103310242143413023 |
6 | 1505330310003405 |
7 | 120104422264403 |
oct | 14561022127635 |
9 | 3076331307075 |
10 | 874164826013 |
11 | 307805289236 |
12 | 121504046565 |
13 | 645832059cb |
14 | 3044a159473 |
15 | 17b14385478 |
hex | cb8848af9d |
874164826013 has 2 divisors, whose sum is σ = 874164826014. Its totient is φ = 874164826012.
The previous prime is 874164825991. The next prime is 874164826019. The reversal of 874164826013 is 310628461478.
874164826013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 567909945604 + 306254880409 = 753598^2 + 553403^2 .
It is a cyclic number.
It is not a de Polignac number, because 874164826013 - 210 = 874164824989 is a prime.
It is a super-2 number, since 2×8741648260132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (874164826019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 437082413006 + 437082413007.
It is an arithmetic number, because the mean of its divisors is an integer number (437082413007).
Almost surely, 2874164826013 is an apocalyptic number.
It is an amenable number.
874164826013 is a deficient number, since it is larger than the sum of its proper divisors (1).
874164826013 is an equidigital number, since it uses as much as digits as its factorization.
874164826013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1548288, while the sum is 50.
The spelling of 874164826013 in words is "eight hundred seventy-four billion, one hundred sixty-four million, eight hundred twenty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •