Base | Representation |
---|---|
bin | 101101011110110101011111… |
… | …111110100001111110110101 |
3 | 222020020210021211100202121000 |
4 | 231132311133332201332311 |
5 | 202204302214224313440 |
6 | 1545233010124113513 |
7 | 60063525451661355 |
oct | 5536653776417665 |
9 | 866223254322530 |
10 | 200031122104245 |
11 | 588107a4699963 |
12 | 1a527456095899 |
13 | 877cb13c73a93 |
14 | 37577b50c2b65 |
15 | 181d406468730 |
hex | b5ed5ffa1fb5 |
200031122104245 has 32 divisors (see below), whose sum is σ = 356754327171840. Its totient is φ = 106340232093120.
The previous prime is 200031122104211. The next prime is 200031122104427. The reversal of 200031122104245 is 542401221130002.
200031122104245 is a `hidden beast` number, since 2 + 0 + 0 + 0 + 3 + 11 + 221 + 0 + 424 + 5 = 666.
It is not a de Polignac number, because 200031122104245 - 211 = 200031122102197 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2382131674 + ... + 2382215643.
It is an arithmetic number, because the mean of its divisors is an integer number (11148572724120).
Almost surely, 2200031122104245 is an apocalyptic number.
It is an amenable number.
200031122104245 is a deficient number, since it is larger than the sum of its proper divisors (156723205067595).
200031122104245 is a wasteful number, since it uses less digits than its factorization.
200031122104245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4764347642 (or 4764347636 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 200031122104245 its reverse (542401221130002), we get a palindrome (742432343234247).
The spelling of 200031122104245 in words is "two hundred trillion, thirty-one billion, one hundred twenty-two million, one hundred four thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •