Base | Representation |
---|---|
bin | 1010100001010010110101… |
… | …11101110111001000011111 |
3 | 10000220121110120101101001000 |
4 | 11100221122331313020133 |
5 | 11013012340311203203 |
6 | 121111414114321343 |
7 | 4605251352445245 |
oct | 520513275671037 |
9 | 100817416341030 |
10 | 23134220022303 |
11 | 740a193105085 |
12 | 2717697589253 |
13 | cba717084780 |
14 | 59d9b8c88795 |
15 | 2a1b92b754a3 |
hex | 150a5af7721f |
23134220022303 has 64 divisors (see below), whose sum is σ = 38353254912000. Its totient is φ = 13683890763648.
The previous prime is 23134220022293. The next prime is 23134220022311. The reversal of 23134220022303 is 30322002243132.
23134220022303 is a `hidden beast` number, since 2 + 3 + 1 + 3 + 422 + 0 + 0 + 2 + 230 + 3 = 666.
It is not a de Polignac number, because 23134220022303 - 28 = 23134220022047 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23134220022103) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2825913 + ... + 7365746.
It is an arithmetic number, because the mean of its divisors is an integer number (599269608000).
Almost surely, 223134220022303 is an apocalyptic number.
23134220022303 is a deficient number, since it is larger than the sum of its proper divisors (15219034889697).
23134220022303 is a wasteful number, since it uses less digits than its factorization.
23134220022303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10191933 (or 10191927 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 23134220022303 its reverse (30322002243132), we get a palindrome (53456222265435).
The spelling of 23134220022303 in words is "twenty-three trillion, one hundred thirty-four billion, two hundred twenty million, twenty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •