Base | Representation |
---|---|
bin | 1010100000111110001000… |
… | …10010110110101000111111 |
3 | 10000212112202202022001122120 |
4 | 11100133010102312220333 |
5 | 11012322103132343403 |
6 | 121102335001414023 |
7 | 4604406013000650 |
oct | 520370422665077 |
9 | 100775682261576 |
10 | 23123102231103 |
11 | 74054a8433a96 |
12 | 27154b419a313 |
13 | cb96649276b4 |
14 | 59d2424b5527 |
15 | 2a1741ab9e53 |
hex | 1507c44b6a3f |
23123102231103 has 8 divisors (see below), whose sum is σ = 35235203399808. Its totient is φ = 13213201274904.
The previous prime is 23123102231101. The next prime is 23123102231129. The reversal of 23123102231103 is 30113220132132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23123102231103 - 21 = 23123102231101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23123102231101) 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 7 ways as a sum of consecutive naturals, for example, 550550053101 + ... + 550550053142.
It is an arithmetic number, because the mean of its divisors is an integer number (4404400424976).
Almost surely, 223123102231103 is an apocalyptic number.
23123102231103 is a deficient number, since it is larger than the sum of its proper divisors (12112101168705).
23123102231103 is a wasteful number, since it uses less digits than its factorization.
23123102231103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101100106253.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 23123102231103 its reverse (30113220132132), we get a palindrome (53236322363235).
The spelling of 23123102231103 in words is "twenty-three trillion, one hundred twenty-three billion, one hundred two million, two hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •