Base | Representation |
---|---|
bin | 101111011111111011… |
… | …0101001000101100101 |
3 | 100202021202200022022120 |
4 | 1132333312221011211 |
5 | 3132400233121013 |
6 | 114505354420153 |
7 | 10240505236230 |
oct | 1367766510545 |
9 | 322252608276 |
10 | 102003020133 |
11 | 3a294055843 |
12 | 17928731659 |
13 | 98077a3661 |
14 | 4d190a4417 |
15 | 29beee7123 |
hex | 17bfda9165 |
102003020133 has 16 divisors (see below), whose sum is σ = 163613867520. Its totient is φ = 55219679856.
The previous prime is 102003020123. The next prime is 102003020143. The reversal of 102003020133 is 331020300201.
It is an interprime number because it is at equal distance from previous prime (102003020123) and next prime (102003020143).
It is not a de Polignac number, because 102003020133 - 214 = 102003003749 is a prime.
It is a super-2 number, since 2×1020030201332 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102003020123) 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, 127822935 + ... + 127823732.
It is an arithmetic number, because the mean of its divisors is an integer number (10225866720).
Almost surely, 2102003020133 is an apocalyptic number.
It is an amenable number.
102003020133 is a deficient number, since it is larger than the sum of its proper divisors (61610847387).
102003020133 is a wasteful number, since it uses less digits than its factorization.
102003020133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255646696.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 102003020133 its reverse (331020300201), we get a palindrome (433023320334).
The spelling of 102003020133 in words is "one hundred two billion, three million, twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •