Base | Representation |
---|---|
bin | 1011101101101001101… |
… | …1101111010001100111 |
3 | 201020102021202202012001 |
4 | 2323122123233101213 |
5 | 11244111144401411 |
6 | 232240101510131 |
7 | 20352513656650 |
oct | 2733233572147 |
9 | 636367682161 |
10 | 201233200231 |
11 | 78384993848 |
12 | 33000712347 |
13 | 15c8c96915b |
14 | 9a4dbb4527 |
15 | 537b86bdc1 |
hex | 2eda6ef467 |
201233200231 has 8 divisors (see below), whose sum is σ = 230015820320. Its totient is φ = 172459335168.
The previous prime is 201233200199. The next prime is 201233200247. The reversal of 201233200231 is 132002332102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201233200231 - 25 = 201233200199 is a prime.
It is a super-2 number, since 2×2012332002312 (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 = 201233200199 and 201233200208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201233800231) 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, 2139426 + ... + 2231503.
It is an arithmetic number, because the mean of its divisors is an integer number (28751977540).
Almost surely, 2201233200231 is an apocalyptic number.
201233200231 is a deficient number, since it is larger than the sum of its proper divisors (28782620089).
201233200231 is an equidigital number, since it uses as much as digits as its factorization.
201233200231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4377513.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 201233200231 its reverse (132002332102), we get a palindrome (333235532333).
The spelling of 201233200231 in words is "two hundred one billion, two hundred thirty-three million, two hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •