Base | Representation |
---|---|
bin | 1011101101010001001… |
… | …0011100100111101111 |
3 | 201020011002202202221120 |
4 | 2323110102130213233 |
5 | 11243403301214411 |
6 | 232221540032023 |
7 | 20350122436533 |
oct | 2732422344757 |
9 | 636132682846 |
10 | 201130101231 |
11 | 78331775a64 |
12 | 32b92092613 |
13 | 15c744abc27 |
14 | 9a40217bc3 |
15 | 53727a4106 |
hex | 2ed449c9ef |
201130101231 has 4 divisors (see below), whose sum is σ = 268173468312. Its totient is φ = 134086734152.
The previous prime is 201130101209. The next prime is 201130101233. The reversal of 201130101231 is 132101031102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201130101231 - 29 = 201130100719 is a prime.
It is a super-2 number, since 2×2011301012312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201130101231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201130101233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33521683536 + ... + 33521683541.
It is an arithmetic number, because the mean of its divisors is an integer number (67043367078).
Almost surely, 2201130101231 is an apocalyptic number.
201130101231 is a deficient number, since it is larger than the sum of its proper divisors (67043367081).
201130101231 is an equidigital number, since it uses as much as digits as its factorization.
201130101231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67043367080.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 201130101231 its reverse (132101031102), we get a palindrome (333231132333).
The spelling of 201130101231 in words is "two hundred one billion, one hundred thirty million, one hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •