Base | Representation |
---|---|
bin | 101101100011001110110001… |
… | …000011010011100101111001 |
3 | 222021022122211021112112122021 |
4 | 231203032301003103211321 |
5 | 202224224222241134431 |
6 | 1550023434105554441 |
7 | 60124406500631320 |
oct | 5543166103234571 |
9 | 867278737475567 |
10 | 200333130021241 |
11 | 5891789224a998 |
12 | 1a575a9baa5a21 |
13 | 87a2443a8c449 |
14 | 3768264b810b7 |
15 | 18261d0050b11 |
hex | b633b10d3979 |
200333130021241 has 32 divisors (see below), whose sum is σ = 236862909038592. Its totient is φ = 165849116060160.
The previous prime is 200333130021187. The next prime is 200333130021257. The reversal of 200333130021241 is 142120031333002.
It is a cyclic number.
It is not a de Polignac number, because 200333130021241 - 227 = 200332995803513 is a prime.
It is a super-2 number, since 2×2003331300212412 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200333130021841) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2061904035 + ... + 2062001191.
It is an arithmetic number, because the mean of its divisors is an integer number (7401965907456).
Almost surely, 2200333130021241 is an apocalyptic number.
It is an amenable number.
200333130021241 is a deficient number, since it is larger than the sum of its proper divisors (36529779017351).
200333130021241 is a wasteful number, since it uses less digits than its factorization.
200333130021241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155449.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 200333130021241 its reverse (142120031333002), we get a palindrome (342453161354243).
The spelling of 200333130021241 in words is "two hundred trillion, three hundred thirty-three billion, one hundred thirty million, twenty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •