Base | Representation |
---|---|
bin | 1010100100000101011011… |
… | …11111011111111101010111 |
3 | 10001020202221202200202102012 |
4 | 11102002231333133331113 |
5 | 11021100222133203421 |
6 | 121223432303134435 |
7 | 4615214406036623 |
oct | 522025577377527 |
9 | 101222852622365 |
10 | 23230102241111 |
11 | 7446916120227 |
12 | 27321962a441b |
13 | cc678774479c |
14 | 5a44b3096183 |
15 | 2a440562195b |
hex | 1520adfdff57 |
23230102241111 has 8 divisors (see below), whose sum is σ = 23321421816000. Its totient is φ = 23138924139360.
The previous prime is 23230102241053. The next prime is 23230102241131. The reversal of 23230102241111 is 11114220103232.
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-23230102241111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23230102241131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35039231 + ... + 35696048.
It is an arithmetic number, because the mean of its divisors is an integer number (2915177727000).
Almost surely, 223230102241111 is an apocalyptic number.
23230102241111 is a deficient number, since it is larger than the sum of its proper divisors (91319574889).
23230102241111 is an equidigital number, since it uses as much as digits as its factorization.
23230102241111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70736569.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 23230102241111 its reverse (11114220103232), we get a palindrome (34344322344343).
The spelling of 23230102241111 in words is "twenty-three trillion, two hundred thirty billion, one hundred two million, two hundred forty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •