Base | Representation |
---|---|
bin | 1010011110010100011100… |
… | …01100001100000110101011 |
3 | 10000112211121200202102121100 |
4 | 11033022032030030012223 |
5 | 11004324014022414011 |
6 | 120552431013012443 |
7 | 4565002302345015 |
oct | 517121614140653 |
9 | 100484550672540 |
10 | 23032000201131 |
11 | 737a8a8741529 |
12 | 26bb90a324123 |
13 | cb0ba66c379c |
14 | 598a7d0ab1b5 |
15 | 29e1adb05d56 |
hex | 14f28e30c1ab |
23032000201131 has 12 divisors (see below), whose sum is σ = 35225412072552. Its totient is φ = 14451451106496.
The previous prime is 23032000201127. The next prime is 23032000201159. The reversal of 23032000201131 is 13110200023032.
23032000201131 is a `hidden beast` number, since 230 + 3 + 200 + 0 + 201 + 1 + 31 = 666.
It is not a de Polignac number, because 23032000201131 - 22 = 23032000201127 is a prime.
It is a super-2 number, since 2×230320002011312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (23032000201121) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 75267974361 + ... + 75267974666.
It is an arithmetic number, because the mean of its divisors is an integer number (2935451006046).
Almost surely, 223032000201131 is an apocalyptic number.
23032000201131 is a deficient number, since it is larger than the sum of its proper divisors (12193411871421).
23032000201131 is a wasteful number, since it uses less digits than its factorization.
23032000201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150535949050 (or 150535949047 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 23032000201131 its reverse (13110200023032), we get a palindrome (36142200224163).
The spelling of 23032000201131 in words is "twenty-three trillion, thirty-two billion, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •