Base | Representation |
---|---|
bin | 10001010111111110010010… |
… | …000001110011101000111011 |
3 | 101000120010102220012111200101 |
4 | 101113332102001303220323 |
5 | 40003432302024012311 |
6 | 430304112131020231 |
7 | 22044513302343535 |
oct | 2127762201635073 |
9 | 330503386174611 |
10 | 76414213110331 |
11 | 223910a4206048 |
12 | 86a170543a677 |
13 | 3383aa21ab495 |
14 | 14c2679326855 |
15 | 8c7a98053ec1 |
hex | 457f92073a3b |
76414213110331 has 4 divisors (see below), whose sum is σ = 76427210941200. Its totient is φ = 76401215279464.
The previous prime is 76414213110269. The next prime is 76414213110343. The reversal of 76414213110331 is 13301131241467.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 76414213110331 - 211 = 76414213108283 is a prime.
It is a super-2 number, since 2×764142131103312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (76414213119331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6498906616 + ... + 6498918373.
It is an arithmetic number, because the mean of its divisors is an integer number (19106802735300).
Almost surely, 276414213110331 is an apocalyptic number.
76414213110331 is a deficient number, since it is larger than the sum of its proper divisors (12997830869).
76414213110331 is a wasteful number, since it uses less digits than its factorization.
76414213110331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12997830868.
The product of its (nonzero) digits is 36288, while the sum is 37.
Adding to 76414213110331 its reverse (13301131241467), we get a palindrome (89715344351798).
The spelling of 76414213110331 in words is "seventy-six trillion, four hundred fourteen billion, two hundred thirteen million, one hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •