Base | Representation |
---|---|
bin | 1010110000101100000011… |
… | …01111011010000110110111 |
3 | 10002210011201201022120002220 |
4 | 11120112001233122012313 |
5 | 11100144113242202411 |
6 | 122154411324133423 |
7 | 4661414645144124 |
oct | 530260157320667 |
9 | 102704651276086 |
10 | 23663151522231 |
11 | 75a35391566a1 |
12 | 27a20b1697273 |
13 | 102856c0c5570 |
14 | 5bb43465774b |
15 | 2b07ed6beb06 |
hex | 158581bda1b7 |
23663151522231 has 16 divisors (see below), whose sum is σ = 35976556161504. Its totient is φ = 13705354727424.
The previous prime is 23663151522203. The next prime is 23663151522251. The reversal of 23663151522231 is 13222515136632.
It is not a de Polignac number, because 23663151522231 - 27 = 23663151522103 is a prime.
It is a super-2 number, since 2×236631515222312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23663151522251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17845513306 + ... + 17845514631.
It is an arithmetic number, because the mean of its divisors is an integer number (2248534760094).
Almost surely, 223663151522231 is an apocalyptic number.
23663151522231 is a deficient number, since it is larger than the sum of its proper divisors (12313404639273).
23663151522231 is a wasteful number, since it uses less digits than its factorization.
23663151522231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35691027970.
The product of its digits is 388800, while the sum is 42.
Adding to 23663151522231 its reverse (13222515136632), we get a palindrome (36885666658863).
The spelling of 23663151522231 in words is "twenty-three trillion, six hundred sixty-three billion, one hundred fifty-one million, five hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •