Base | Representation |
---|---|
bin | 1010100100000111010100… |
… | …00100101110000000010011 |
3 | 10001020212120000102112010102 |
4 | 11102003222010232000103 |
5 | 11021104303210223243 |
6 | 121224120312123015 |
7 | 4615251365643644 |
oct | 522035204560023 |
9 | 101225500375112 |
10 | 23231110242323 |
11 | 7447293109485 |
12 | 273241799646b |
13 | cc68b85237c9 |
14 | 5a456acc76cb |
15 | 2a4463d839b8 |
hex | 1520ea12e013 |
23231110242323 has 4 divisors (see below), whose sum is σ = 23323664466648. Its totient is φ = 23138556018000.
The previous prime is 23231110242299. The next prime is 23231110242377. The reversal of 23231110242323 is 32324201113232.
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 23231110242323 - 228 = 23230841806867 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23231110248323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46277111786 + ... + 46277112287.
It is an arithmetic number, because the mean of its divisors is an integer number (5830916116662).
Almost surely, 223231110242323 is an apocalyptic number.
23231110242323 is a deficient number, since it is larger than the sum of its proper divisors (92554224325).
23231110242323 is an equidigital number, since it uses as much as digits as its factorization.
23231110242323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92554224324.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 23231110242323 its reverse (32324201113232), we get a palindrome (55555311355555).
The spelling of 23231110242323 in words is "twenty-three trillion, two hundred thirty-one billion, one hundred ten million, two hundred forty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •