Base | Representation |
---|---|
bin | 101110011001001011001011… |
… | …101001111011100000111111 |
3 | 222202110001020200220000110000 |
4 | 232121023023221323200333 |
5 | 203220443143040132203 |
6 | 2001542424303445343 |
7 | 60656261465310501 |
oct | 5631131351734077 |
9 | 882401220800400 |
10 | 204040133130303 |
11 | 5a016a309227a8 |
12 | 1aa744178b6853 |
13 | 89b0b958b03a2 |
14 | 38558490a7d71 |
15 | 188c84357c4a3 |
hex | b992cba7b83f |
204040133130303 has 10 divisors (see below), whose sum is σ = 304800692700944. Its totient is φ = 136026755420148.
The previous prime is 204040133130257. The next prime is 204040133130331. The reversal of 204040133130303 is 303031331040402.
204040133130303 is a `hidden beast` number, since 2 + 0 + 4 + 0 + 40 + 1 + 3 + 313 + 0 + 303 = 666.
It is not a de Polignac number, because 204040133130303 - 210 = 204040133129279 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204040133120303) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1259506994551 + ... + 1259506994712.
Almost surely, 2204040133130303 is an apocalyptic number.
204040133130303 is a deficient number, since it is larger than the sum of its proper divisors (100760559570641).
204040133130303 is an equidigital number, since it uses as much as digits as its factorization.
204040133130303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2519013989275 (or 2519013989266 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 27.
Adding to 204040133130303 its reverse (303031331040402), we get a palindrome (507071464170705).
The spelling of 204040133130303 in words is "two hundred four trillion, forty billion, one hundred thirty-three million, one hundred thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •