Base | Representation |
---|---|
bin | 1010100000101011101101… |
… | …10000000001011011010111 |
3 | 10000211121020102210201101120 |
4 | 11100111312300001123113 |
5 | 11012141324044220043 |
6 | 121054021313055023 |
7 | 4603605631434336 |
oct | 520256660013327 |
9 | 100747212721346 |
10 | 23113211320023 |
11 | 7401292259110 |
12 | 27135b3857473 |
13 | cb87497139a6 |
14 | 59c984a2bd1d |
15 | 2a13635a9983 |
hex | 150576c016d7 |
23113211320023 has 64 divisors (see below), whose sum is σ = 36135284544000. Its totient is φ = 12993409013760.
The previous prime is 23113211319941. The next prime is 23113211320049. The reversal of 23113211320023 is 32002311231132.
It is not a de Polignac number, because 23113211320023 - 29 = 23113211319511 is a prime.
It is a super-4 number, since 4×231132113200234 (a number of 55 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23113211319975 and 23113211320002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23113211320723) 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, 4427653 + ... + 8113601.
It is an arithmetic number, because the mean of its divisors is an integer number (564613821000).
Almost surely, 223113211320023 is an apocalyptic number.
23113211320023 is a deficient number, since it is larger than the sum of its proper divisors (13022073223977).
23113211320023 is a wasteful number, since it uses less digits than its factorization.
23113211320023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3686192.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 23113211320023 its reverse (32002311231132), we get a palindrome (55115522551155).
The spelling of 23113211320023 in words is "twenty-three trillion, one hundred thirteen billion, two hundred eleven million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •