Base | Representation |
---|---|
bin | 10000110101010011100010… |
… | …101010100101111111101111 |
3 | 100201010101011112212222111112 |
4 | 100311103202222211333233 |
5 | 34200414221414132401 |
6 | 421241433325142235 |
7 | 21410424324545123 |
oct | 2065234252457757 |
9 | 321111145788445 |
10 | 74031859130351 |
11 | 2165280a521991 |
12 | 8377a539ba97b |
13 | 32402360bb755 |
14 | 143d2380b9583 |
15 | 885b129133bb |
hex | 4354e2aa5fef |
74031859130351 has 2 divisors, whose sum is σ = 74031859130352. Its totient is φ = 74031859130350.
The previous prime is 74031859130309. The next prime is 74031859130393. The reversal of 74031859130351 is 15303195813047.
It is a balanced prime because it is at equal distance from previous prime (74031859130309) and next prime (74031859130393).
It is a cyclic number.
It is not a de Polignac number, because 74031859130351 - 26 = 74031859130287 is a prime.
It is a super-2 number, since 2×740318591303512 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 74031859130351.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (74031859132351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 37015929565175 + 37015929565176.
It is an arithmetic number, because the mean of its divisors is an integer number (37015929565176).
Almost surely, 274031859130351 is an apocalyptic number.
74031859130351 is a deficient number, since it is larger than the sum of its proper divisors (1).
74031859130351 is an equidigital number, since it uses as much as digits as its factorization.
74031859130351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1360800, while the sum is 50.
The spelling of 74031859130351 in words is "seventy-four trillion, thirty-one billion, eight hundred fifty-nine million, one hundred thirty thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •