Base | Representation |
---|---|
bin | 1011101001111011000… |
… | …0111011001011001001 |
3 | 201010211112001122200201 |
4 | 2322132300323023021 |
5 | 11240033410333113 |
6 | 231552501132201 |
7 | 20315636642500 |
oct | 2723660731311 |
9 | 633745048621 |
10 | 200232121033 |
11 | 77a108a316a |
12 | 329813ba061 |
13 | 15b604419b9 |
14 | 9996c65837 |
15 | 531da25cdd |
hex | 2e9ec3b2c9 |
200232121033 has 6 divisors (see below), whose sum is σ = 232923079626. Its totient is φ = 171627532272.
The previous prime is 200232121031. The next prime is 200232121043. The reversal of 200232121033 is 330121232002.
It can be written as a sum of positive squares in only one way, i.e., 198333950409 + 1898170624 = 445347^2 + 43568^2 .
It is not a de Polignac number, because 200232121033 - 21 = 200232121031 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200232121033.
It is not an unprimeable number, because it can be changed into a prime (200232121031) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2043184860 + ... + 2043184957.
It is an arithmetic number, because the mean of its divisors is an integer number (38820513271).
Almost surely, 2200232121033 is an apocalyptic number.
It is an amenable number.
200232121033 is a deficient number, since it is larger than the sum of its proper divisors (32690958593).
200232121033 is an equidigital number, since it uses as much as digits as its factorization.
200232121033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4086369831 (or 4086369824 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 200232121033 its reverse (330121232002), we get a palindrome (530353353035).
The spelling of 200232121033 in words is "two hundred billion, two hundred thirty-two million, one hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •