Base | Representation |
---|---|
bin | 10111001100100110101100… |
… | …000001011100100101010111 |
3 | 111101020010122220221201000022 |
4 | 113030212230001130211113 |
5 | 101333004002011223023 |
6 | 1000551525041335355 |
7 | 30326535352546553 |
oct | 2714465401344527 |
9 | 441203586851008 |
10 | 102021244242263 |
11 | 2a563a6a760675 |
12 | b53849833755b |
13 | 44c073ca99b68 |
14 | 1b29bd6d12863 |
15 | bbdc178927c8 |
hex | 5cc9ac05c957 |
102021244242263 has 2 divisors, whose sum is σ = 102021244242264. Its totient is φ = 102021244242262.
The previous prime is 102021244242221. The next prime is 102021244242347. The reversal of 102021244242263 is 362242442120201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102021244242263 - 232 = 102016949274967 is a prime.
It is a super-2 number, since 2×1020212442422632 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102021244242163) 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, 51010622121131 + 51010622121132.
It is an arithmetic number, because the mean of its divisors is an integer number (51010622121132).
Almost surely, 2102021244242263 is an apocalyptic number.
102021244242263 is a deficient number, since it is larger than the sum of its proper divisors (1).
102021244242263 is an equidigital number, since it uses as much as digits as its factorization.
102021244242263 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 73728, while the sum is 35.
Adding to 102021244242263 its reverse (362242442120201), we get a palindrome (464263686362464).
The spelling of 102021244242263 in words is "one hundred two trillion, twenty-one billion, two hundred forty-four million, two hundred forty-two thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •