Base | Representation |
---|---|
bin | 101111000010000110… |
… | …1100100111100000101 |
3 | 100122201000211111211212 |
4 | 1132010031210330011 |
5 | 3123323103240433 |
6 | 114222211541205 |
7 | 10203635142002 |
oct | 1360415447405 |
9 | 318630744755 |
10 | 101002399493 |
11 | 39920248736 |
12 | 176a95ba805 |
13 | 96a83a9b38 |
14 | 4c622348a9 |
15 | 2962241d48 |
hex | 1784364f05 |
101002399493 has 2 divisors, whose sum is σ = 101002399494. Its totient is φ = 101002399492.
The previous prime is 101002399471. The next prime is 101002399507. The reversal of 101002399493 is 394993200101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88147828609 + 12854570884 = 296897^2 + 113378^2 .
It is a cyclic number.
It is not a de Polignac number, because 101002399493 - 214 = 101002383109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101002399493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101002399403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50501199746 + 50501199747.
It is an arithmetic number, because the mean of its divisors is an integer number (50501199747).
Almost surely, 2101002399493 is an apocalyptic number.
It is an amenable number.
101002399493 is a deficient number, since it is larger than the sum of its proper divisors (1).
101002399493 is an equidigital number, since it uses as much as digits as its factorization.
101002399493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52488, while the sum is 41.
Adding to 101002399493 its reverse (394993200101), we get a palindrome (495995599594).
The spelling of 101002399493 in words is "one hundred one billion, two million, three hundred ninety-nine thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •