Base | Representation |
---|---|
bin | 10111001100010101111111… |
… | …010000010111110100011011 |
3 | 111101011102101021202000111010 |
4 | 113030111333100113310123 |
5 | 101332210241201423003 |
6 | 1000535401503305003 |
7 | 30325332123262206 |
oct | 2714257720276433 |
9 | 441142337660433 |
10 | 102003313311003 |
11 | 2a5573a9163615 |
12 | b534b132ab163 |
13 | 44bbb42c70270 |
14 | 1b28db574493d |
15 | bbd5185ce003 |
hex | 5cc57f417d1b |
102003313311003 has 8 divisors (see below), whose sum is σ = 146466296036368. Its totient is φ = 62771269729824.
The previous prime is 102003313310981. The next prime is 102003313311041. The reversal of 102003313311003 is 300113313300201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102003313311003 - 29 = 102003313310491 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102003313312003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1307734786000 + ... + 1307734786077.
It is an arithmetic number, because the mean of its divisors is an integer number (18308287004546).
Almost surely, 2102003313311003 is an apocalyptic number.
102003313311003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
102003313311003 is a deficient number, since it is larger than the sum of its proper divisors (44462982725365).
102003313311003 is a wasteful number, since it uses less digits than its factorization.
102003313311003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2615469572093.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 102003313311003 its reverse (300113313300201), we get a palindrome (402116626611204).
The spelling of 102003313311003 in words is "one hundred two trillion, three billion, three hundred thirteen million, three hundred eleven thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •