Base | Representation |
---|---|
bin | 1001000111010111001000… |
… | …1011101011101100010101 |
3 | 1022111002201121001021021221 |
4 | 2101311302023223230111 |
5 | 2303200202014213431 |
6 | 33152024415210341 |
7 | 2053033226354533 |
oct | 221656213535425 |
9 | 38432647037257 |
10 | 10022074366741 |
11 | 3214379783518 |
12 | 115a4185169b1 |
13 | 5791015177a8 |
14 | 2690dcb0b153 |
15 | 125a6cd61111 |
hex | 91d722ebb15 |
10022074366741 has 2 divisors, whose sum is σ = 10022074366742. Its totient is φ = 10022074366740.
The previous prime is 10022074366723. The next prime is 10022074366783. The reversal of 10022074366741 is 14766347022001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9119469863716 + 902604503025 = 3019846^2 + 950055^2 .
It is a cyclic number.
It is not a de Polignac number, because 10022074366741 - 241 = 7823051111189 is a prime.
It is a super-2 number, since 2×100220743667412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10022074367741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5011037183370 + 5011037183371.
It is an arithmetic number, because the mean of its divisors is an integer number (5011037183371).
Almost surely, 210022074366741 is an apocalyptic number.
It is an amenable number.
10022074366741 is a deficient number, since it is larger than the sum of its proper divisors (1).
10022074366741 is an equidigital number, since it uses as much as digits as its factorization.
10022074366741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 338688, while the sum is 43.
The spelling of 10022074366741 in words is "ten trillion, twenty-two billion, seventy-four million, three hundred sixty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •