Base | Representation |
---|---|
bin | 11101001000110010100… |
… | …000011001000110000101 |
3 | 21002102021212200021010102 |
4 | 131020302200121012011 |
5 | 230301203320042013 |
6 | 4131502255133445 |
7 | 264442625064161 |
oct | 35106240310605 |
9 | 7072255607112 |
10 | 2002302112133 |
11 | 7021983847a4 |
12 | 284086b14285 |
13 | 116a7c4989bb |
14 | 6ccaa50bca1 |
15 | 37140169d58 |
hex | 1d232819185 |
2002302112133 has 8 divisors (see below), whose sum is σ = 2089493921088. Its totient is φ = 1915121569504.
The previous prime is 2002302112081. The next prime is 2002302112177. The reversal of 2002302112133 is 3312112032002.
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 2002302112133 - 28 = 2002302111877 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002302112183) 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, 2452391 + ... + 3165252.
It is an arithmetic number, because the mean of its divisors is an integer number (261186740136).
Almost surely, 22002302112133 is an apocalyptic number.
2002302112133 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2002302112133 is a deficient number, since it is larger than the sum of its proper divisors (87191808955).
2002302112133 is a wasteful number, since it uses less digits than its factorization.
2002302112133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5633163.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2002302112133 its reverse (3312112032002), we get a palindrome (5314414144135).
The spelling of 2002302112133 in words is "two trillion, two billion, three hundred two million, one hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •