Base | Representation |
---|---|
bin | 1001011110100001010010… |
… | …0111101110000000010101 |
3 | 1100220010200022001200012202 |
4 | 2113220110213232000111 |
5 | 2331210012233211334 |
6 | 34054504112054245 |
7 | 2123546512603502 |
oct | 227502447560025 |
9 | 40803608050182 |
10 | 10419936616469 |
11 | 3358085633456 |
12 | 1203553834385 |
13 | 5a7798cab433 |
14 | 280482dd84a9 |
15 | 1310a6c3717e |
hex | 97a149ee015 |
10419936616469 has 2 divisors, whose sum is σ = 10419936616470. Its totient is φ = 10419936616468.
The previous prime is 10419936616447. The next prime is 10419936616547. The reversal of 10419936616469 is 96461663991401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8912045943025 + 1507890673444 = 2985305^2 + 1227962^2 .
It is an emirp because it is prime and its reverse (96461663991401) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10419936616469 is a prime.
It is a super-2 number, since 2×104199366164692 (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 (10419936616409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5209968308234 + 5209968308235.
It is an arithmetic number, because the mean of its divisors is an integer number (5209968308235).
Almost surely, 210419936616469 is an apocalyptic number.
It is an amenable number.
10419936616469 is a deficient number, since it is larger than the sum of its proper divisors (1).
10419936616469 is an equidigital number, since it uses as much as digits as its factorization.
10419936616469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 45349632, while the sum is 65.
The spelling of 10419936616469 in words is "ten trillion, four hundred nineteen billion, nine hundred thirty-six million, six hundred sixteen thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •