Base | Representation |
---|---|
bin | 10111001100010100110111… |
… | …101010100000100111000011 |
3 | 111101011022021120122102100001 |
4 | 113030110313222200213003 |
5 | 101332200311211000303 |
6 | 1000535042355340431 |
7 | 30325260300111202 |
oct | 2714246752404703 |
9 | 441138246572301 |
10 | 102002112203203 |
11 | 2a556942170543 |
12 | b534838bb1717 |
13 | 44bb9b117b7a4 |
14 | 1b28d00007239 |
15 | bbd497e2531d |
hex | 5cc537aa09c3 |
102002112203203 has 8 divisors (see below), whose sum is σ = 103739196221360. Its totient is φ = 100267122322080.
The previous prime is 102002112203153. The next prime is 102002112203213. The reversal of 102002112203203 is 302302211200201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102002112203203 - 241 = 99803088947651 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102002112203213) 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 7 ways as a sum of consecutive naturals, for example, 523436013 + ... + 523630846.
It is an arithmetic number, because the mean of its divisors is an integer number (12967399527670).
Almost surely, 2102002112203203 is an apocalyptic number.
102002112203203 is a deficient number, since it is larger than the sum of its proper divisors (1737084018157).
102002112203203 is a wasteful number, since it uses less digits than its factorization.
102002112203203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1047068517.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 102002112203203 its reverse (302302211200201), we get a palindrome (404304323403404).
The spelling of 102002112203203 in words is "one hundred two trillion, two billion, one hundred twelve million, two hundred three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •