Base | Representation |
---|---|
bin | 10001010010011011010110… |
… | …001000011101100000110001 |
3 | 100222012200201201110020220111 |
4 | 101102123112020131200301 |
5 | 34431211244011203144 |
6 | 425413043043541321 |
7 | 22005132121161316 |
oct | 2122332610354061 |
9 | 328180651406814 |
10 | 76033103616049 |
11 | 222545048a3248 |
12 | 863b88468a841 |
13 | 3356b77421798 |
14 | 14ac043d58d0d |
15 | 8bcbdecb7534 |
hex | 4526d621d831 |
76033103616049 has 2 divisors, whose sum is σ = 76033103616050. Its totient is φ = 76033103616048.
The previous prime is 76033103615983. The next prime is 76033103616073. The reversal of 76033103616049 is 94061630133067.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75477173817600 + 555929798449 = 8687760^2 + 745607^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-76033103616049 is a prime.
It is a super-2 number, since 2×760331036160492 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 76033103615993 and 76033103616011.
It is not a weakly prime, because it can be changed into another prime (76033103616149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 38016551808024 + 38016551808025.
It is an arithmetic number, because the mean of its divisors is an integer number (38016551808025).
Almost surely, 276033103616049 is an apocalyptic number.
It is an amenable number.
76033103616049 is a deficient number, since it is larger than the sum of its proper divisors (1).
76033103616049 is an equidigital number, since it uses as much as digits as its factorization.
76033103616049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1469664, while the sum is 49.
The spelling of 76033103616049 in words is "seventy-six trillion, thirty-three billion, one hundred three million, six hundred sixteen thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •