Base | Representation |
---|---|
bin | 1010100110110011000010… |
… | …00101110011110011001011 |
3 | 10001120200111222020000122202 |
4 | 11103121201011303303023 |
5 | 11024112110120030443 |
6 | 121334324323110415 |
7 | 4625024102160404 |
oct | 523314105636313 |
9 | 101520458200582 |
10 | 23323301330123 |
11 | 74823a1622233 |
12 | 274826651240b |
13 | 10024bb276a32 |
14 | 5a8bd4bc29ab |
15 | 2a6a5c76b7b8 |
hex | 153661173ccb |
23323301330123 has 4 divisors (see below), whose sum is σ = 23585360895720. Its totient is φ = 23061241764528.
The previous prime is 23323301330101. The next prime is 23323301330171. The reversal of 23323301330123 is 32103310332332.
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 23323301330123 - 210 = 23323301329099 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23323301350123) 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 3 ways as a sum of consecutive naturals, for example, 131029782665 + ... + 131029782842.
It is an arithmetic number, because the mean of its divisors is an integer number (5896340223930).
Almost surely, 223323301330123 is an apocalyptic number.
23323301330123 is a deficient number, since it is larger than the sum of its proper divisors (262059565597).
23323301330123 is an equidigital number, since it uses as much as digits as its factorization.
23323301330123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262059565596.
The product of its (nonzero) digits is 17496, while the sum is 29.
Adding to 23323301330123 its reverse (32103310332332), we get a palindrome (55426611662455).
The spelling of 23323301330123 in words is "twenty-three trillion, three hundred twenty-three billion, three hundred one million, three hundred thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •