Base | Representation |
---|---|
bin | 1010011101110011010010… |
… | …01101111100001110101111 |
3 | 10000111010200011121021001022 |
4 | 11032321221031330032233 |
5 | 11004031040202043343 |
6 | 120540324425404355 |
7 | 4563502221413456 |
oct | 516715115741657 |
9 | 100433604537038 |
10 | 23014200034223 |
11 | 73732a3a38692 |
12 | 26b83810396bb |
13 | cac2ca9bc548 |
14 | 597c7101bb9d |
15 | 29d9bb072568 |
hex | 14ee6937c3af |
23014200034223 has 4 divisors (see below), whose sum is σ = 23014619161560. Its totient is φ = 23013780906888.
The previous prime is 23014200034219. The next prime is 23014200034249. The reversal of 23014200034223 is 32243000241032.
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 23014200034223 - 22 = 23014200034219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23014200034192 and 23014200034201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23014200034823) 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, 209481293 + ... + 209591126.
It is an arithmetic number, because the mean of its divisors is an integer number (5753654790390).
Almost surely, 223014200034223 is an apocalyptic number.
23014200034223 is a deficient number, since it is larger than the sum of its proper divisors (419127337).
23014200034223 is an equidigital number, since it uses as much as digits as its factorization.
23014200034223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419127336.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 23014200034223 its reverse (32243000241032), we get a palindrome (55257200275255).
The spelling of 23014200034223 in words is "twenty-three trillion, fourteen billion, two hundred million, thirty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •