Base | Representation |
---|---|
bin | 101101101110110110000011… |
… | …101101011001101001110001 |
3 | 222101010221212110111212011202 |
4 | 231232312003231121221301 |
5 | 202330313231201034413 |
6 | 1551434225111220545 |
7 | 60236152313122220 |
oct | 5556660355315161 |
9 | 871127773455152 |
10 | 201131233221233 |
11 | 590a5305744777 |
12 | 1a6846b7077755 |
13 | 882c794a85943 |
14 | 3794b37232cb7 |
15 | 183bd41a67e58 |
hex | b6ed83b59a71 |
201131233221233 has 16 divisors (see below), whose sum is σ = 231065197388160. Its totient is φ = 171498787574400.
The previous prime is 201131233221223. The next prime is 201131233221257. The reversal of 201131233221233 is 332122332131102.
It is a cyclic number.
It is not a de Polignac number, because 201131233221233 - 244 = 183539047176817 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201131233221196 and 201131233221205.
It is not an unprimeable number, because it can be changed into a prime (201131233221223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51697508 + ... + 55451733.
It is an arithmetic number, because the mean of its divisors is an integer number (14441574836760).
Almost surely, 2201131233221233 is an apocalyptic number.
It is an amenable number.
201131233221233 is a deficient number, since it is larger than the sum of its proper divisors (29933964166927).
201131233221233 is a wasteful number, since it uses less digits than its factorization.
201131233221233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107150648.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 201131233221233 its reverse (332122332131102), we get a palindrome (533253565352335).
The spelling of 201131233221233 in words is "two hundred one trillion, one hundred thirty-one billion, two hundred thirty-three million, two hundred twenty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •