Base | Representation |
---|---|
bin | 110110011000011011000… |
… | …0100001000010101011101 |
3 | 222110112002101010010020102 |
4 | 1230300312010020111131 |
5 | 1434424024414204141 |
6 | 23521324400430445 |
7 | 1400663260010066 |
oct | 154606604102535 |
9 | 28415071103212 |
10 | 7474150147421 |
11 | 24218509a8a11 |
12 | a08659918425 |
13 | 422a6a153a39 |
14 | 1bba7228b56d |
15 | ce646c3b99b |
hex | 6cc3610855d |
7474150147421 has 2 divisors, whose sum is σ = 7474150147422. Its totient is φ = 7474150147420.
The previous prime is 7474150147397. The next prime is 7474150147463. The reversal of 7474150147421 is 1247410514747.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6061867471396 + 1412282676025 = 2462086^2 + 1188395^2 .
It is an emirp because it is prime and its reverse (1247410514747) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-7474150147421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7474110147421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3737075073710 + 3737075073711.
It is an arithmetic number, because the mean of its divisors is an integer number (3737075073711).
Almost surely, 27474150147421 is an apocalyptic number.
It is an amenable number.
7474150147421 is a deficient number, since it is larger than the sum of its proper divisors (1).
7474150147421 is an equidigital number, since it uses as much as digits as its factorization.
7474150147421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 878080, while the sum is 47.
The spelling of 7474150147421 in words is "seven trillion, four hundred seventy-four billion, one hundred fifty million, one hundred forty-seven thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •