Base | Representation |
---|---|
bin | 1010100011001111110011… |
… | …11110100110000010100111 |
3 | 10001011000122100100021110021 |
4 | 11101213321332212002213 |
5 | 11020112241422114343 |
6 | 121202311414540011 |
7 | 4613145101426050 |
oct | 521477176460247 |
9 | 101130570307407 |
10 | 23201312301223 |
11 | 7435691a34281 |
12 | 27286a0667607 |
13 | cc3b49c86bb4 |
14 | 5a2d41639727 |
15 | 2a37bcd6e0ed |
hex | 1519f9fa60a7 |
23201312301223 has 8 divisors (see below), whose sum is σ = 26516431644192. Its totient is φ = 19886354497536.
The previous prime is 23201312301109. The next prime is 23201312301283. The reversal of 23201312301223 is 32210321310232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23201312301223 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23201312301283) 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, 40076890 + ... + 40651687.
It is an arithmetic number, because the mean of its divisors is an integer number (3314553955524).
Almost surely, 223201312301223 is an apocalyptic number.
23201312301223 is a deficient number, since it is larger than the sum of its proper divisors (3315119342969).
23201312301223 is an equidigital number, since it uses as much as digits as its factorization.
23201312301223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80769641.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 23201312301223 its reverse (32210321310232), we get a palindrome (55411633611455).
Subtracting 23201312301223 from its reverse (32210321310232), we obtain a palindrome (9009009009009).
The spelling of 23201312301223 in words is "twenty-three trillion, two hundred one billion, three hundred twelve million, three hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •