Base | Representation |
---|---|
bin | 10111001100110010000000… |
… | …101111100101000111010011 |
3 | 111101021022001021212122012020 |
4 | 113030302000233211013103 |
5 | 101333203402134241321 |
6 | 1001001255342502523 |
7 | 30330445562615226 |
oct | 2714620057450723 |
9 | 441238037778166 |
10 | 102033403040211 |
11 | 2a56913a013515 |
12 | b53a910294a43 |
13 | 44c1929ac0c66 |
14 | 1b2a62ba695bd |
15 | bbe1ca02e4c6 |
hex | 5ccc80be51d3 |
102033403040211 has 16 divisors (see below), whose sum is σ = 136698988124160. Its totient is φ = 67695241475520.
The previous prime is 102033403040171. The next prime is 102033403040213. The reversal of 102033403040211 is 112040304330201.
It is a happy number.
It is not a de Polignac number, because 102033403040211 - 29 = 102033403039699 is a prime.
It is a super-2 number, since 2×1020334030402112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102033403040213) 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 in 15 ways as a sum of consecutive naturals, for example, 22707330 + ... + 26827031.
It is an arithmetic number, because the mean of its divisors is an integer number (8543686757760).
Almost surely, 2102033403040211 is an apocalyptic number.
102033403040211 is a deficient number, since it is larger than the sum of its proper divisors (34665585083949).
102033403040211 is a wasteful number, since it uses less digits than its factorization.
102033403040211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49537666.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 102033403040211 its reverse (112040304330201), we get a palindrome (214073707370412).
The spelling of 102033403040211 in words is "one hundred two trillion, thirty-three billion, four hundred three million, forty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •