Base | Representation |
---|---|
bin | 1010100110110010101011… |
… | …10000001011110110111011 |
3 | 10001120200000201021221121122 |
4 | 11103121111300023312323 |
5 | 11024111212421041443 |
6 | 121334253410055455 |
7 | 4625016302304104 |
oct | 523312560136673 |
9 | 101520021257548 |
10 | 23323111112123 |
11 | 7482304210679 |
12 | 274821287a58b |
13 | 100248aa35cc4 |
14 | 5a8bb78293ab |
15 | 2a6a4abe5968 |
hex | 153655c0bdbb |
23323111112123 has 8 divisors (see below), whose sum is σ = 23328672145776. Its totient is φ = 23317550754400.
The previous prime is 23323111112117. The next prime is 23323111112233. The reversal of 23323111112123 is 32121111132332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23323111112123 - 210 = 23323111111099 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23323111112092 and 23323111112101.
It is not an unprimeable number, because it can be changed into a prime (23323111612123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72528713 + ... + 72849573.
It is an arithmetic number, because the mean of its divisors is an integer number (2916084018222).
Almost surely, 223323111112123 is an apocalyptic number.
23323111112123 is a deficient number, since it is larger than the sum of its proper divisors (5561033653).
23323111112123 is an equidigital number, since it uses as much as digits as its factorization.
23323111112123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337965.
The product of its digits is 1296, while the sum is 26.
Adding to 23323111112123 its reverse (32121111132332), we get a palindrome (55444222244455).
The spelling of 23323111112123 in words is "twenty-three trillion, three hundred twenty-three billion, one hundred eleven million, one hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •