Base | Representation |
---|---|
bin | 1010011101101111100101… |
… | …01010110110001101001111 |
3 | 10000110221112120010002210112 |
4 | 11032313302222312031033 |
5 | 11004013002021414043 |
6 | 120535355220230235 |
7 | 4563402021064523 |
oct | 516676252661517 |
9 | 100427476102715 |
10 | 23012211123023 |
11 | 7372473285221 |
12 | 26b7b06b3b37b |
13 | cac071928505 |
14 | 597b22c0bd83 |
15 | 29d901650518 |
hex | 14edf2ab634f |
23012211123023 has 4 divisors (see below), whose sum is σ = 23012244159408. Its totient is φ = 23012178086640.
The previous prime is 23012211122977. The next prime is 23012211123043. The reversal of 23012211123023 is 32032111221032.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23012211123023 - 26 = 23012211122959 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 23012211123023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23012211123043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15450323 + ... + 16874148.
It is an arithmetic number, because the mean of its divisors is an integer number (5753061039852).
Almost surely, 223012211123023 is an apocalyptic number.
23012211123023 is a deficient number, since it is larger than the sum of its proper divisors (33036385).
23012211123023 is an equidigital number, since it uses as much as digits as its factorization.
23012211123023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33036384.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 23012211123023 its reverse (32032111221032), we get a palindrome (55044322344055).
The spelling of 23012211123023 in words is "twenty-three trillion, twelve billion, two hundred eleven million, one hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •