Base | Representation |
---|---|
bin | 100010010101010110101001… |
… | …1101110011100011001110101 |
3 | 1110121022010000201210022102002 |
4 | 1010222231103232130121311 |
5 | 304041000124201232013 |
6 | 2550145452313225045 |
7 | 120416632560532214 |
oct | 10452552356343165 |
9 | 1417263021708362 |
10 | 302002030102133 |
11 | 882553838a8069 |
12 | 29a56024a02185 |
13 | cc68891422b4a |
14 | 5480d94b7907b |
15 | 24dab74b98358 |
hex | 112ab53b9c675 |
302002030102133 has 16 divisors (see below), whose sum is σ = 319555343232576. Its totient is φ = 285093492203520.
The previous prime is 302002030102093. The next prime is 302002030102189. The reversal of 302002030102133 is 331201030200203.
It is a cyclic number.
It is not a de Polignac number, because 302002030102133 - 224 = 302002013324917 is a prime.
It is a super-2 number, since 2×3020020301021332 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302002030102033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 988766348 + ... + 989071733.
It is an arithmetic number, because the mean of its divisors is an integer number (19972208952036).
Almost surely, 2302002030102133 is an apocalyptic number.
It is an amenable number.
302002030102133 is a deficient number, since it is larger than the sum of its proper divisors (17553313130443).
302002030102133 is a wasteful number, since it uses less digits than its factorization.
302002030102133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1977838244.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 302002030102133 its reverse (331201030200203), we get a palindrome (633203060302336).
The spelling of 302002030102133 in words is "three hundred two trillion, two billion, thirty million, one hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •