Base | Representation |
---|---|
bin | 110100101001000100010010… |
… | …011010110010011101100001 |
3 | 1010100202010221012001000020101 |
4 | 310221010102122302131201 |
5 | 220321213011400300301 |
6 | 2140223020432542401 |
7 | 66523543225105561 |
oct | 6451042232623541 |
9 | 1110663835030211 |
10 | 231520521103201 |
11 | 67851335487310 |
12 | 21b7228a0b1a01 |
13 | 9c253a3452a35 |
14 | 412591dc0cda1 |
15 | 1bb75a7ab4701 |
hex | d291126b2761 |
231520521103201 has 16 divisors (see below), whose sum is σ = 270219260664000. Its totient is φ = 196126882718400.
The previous prime is 231520521103171. The next prime is 231520521103243. The reversal of 231520521103201 is 102301125025132.
It is a cyclic number.
It is not a de Polignac number, because 231520521103201 - 25 = 231520521103169 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 231520521103201.
It is not an unprimeable number, because it can be changed into a prime (231520521103801) 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, 9079935526 + ... + 9079961023.
It is an arithmetic number, because the mean of its divisors is an integer number (16888703791500).
Almost surely, 2231520521103201 is an apocalyptic number.
It is an amenable number.
231520521103201 is a deficient number, since it is larger than the sum of its proper divisors (38698739560799).
231520521103201 is a wasteful number, since it uses less digits than its factorization.
231520521103201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18159896640.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 231520521103201 its reverse (102301125025132), we get a palindrome (333821646128333).
The spelling of 231520521103201 in words is "two hundred thirty-one trillion, five hundred twenty billion, five hundred twenty-one million, one hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •