Base | Representation |
---|---|
bin | 1011110101000101111… |
… | …0011101011001010101 |
3 | 201102120110212010010212 |
4 | 2331101132131121111 |
5 | 11312203440332013 |
6 | 233210204455205 |
7 | 20453144626013 |
oct | 2752136353125 |
9 | 642513763125 |
10 | 203230402133 |
11 | 7920a29a130 |
12 | 3347954a505 |
13 | 1621a673a25 |
14 | 9b9d1418b3 |
15 | 5446d7a6a8 |
hex | 2f5179d655 |
203230402133 has 8 divisors (see below), whose sum is σ = 225463620960. Its totient is φ = 181623471280.
The previous prime is 203230402121. The next prime is 203230402139. The reversal of 203230402133 is 331204032302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 203230402133 - 28 = 203230401877 is a prime.
It is a super-2 number, since 2×2032304021332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 203230402099 and 203230402108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203230402139) 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, 156571310 + ... + 156572607.
It is an arithmetic number, because the mean of its divisors is an integer number (28182952620).
Almost surely, 2203230402133 is an apocalyptic number.
It is an amenable number.
203230402133 is a deficient number, since it is larger than the sum of its proper divisors (22233218827).
203230402133 is a wasteful number, since it uses less digits than its factorization.
203230402133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 313143987.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 203230402133 its reverse (331204032302), we get a palindrome (534434434435).
The spelling of 203230402133 in words is "two hundred three billion, two hundred thirty million, four hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •