Base | Representation |
---|---|
bin | 1010100110101101010010… |
… | …11111010101000101010111 |
3 | 10001120101120022001122222212 |
4 | 11103112221133111011113 |
5 | 11024034303034343221 |
6 | 121333054525144035 |
7 | 4624554546666116 |
oct | 523265137250527 |
9 | 101511508048885 |
10 | 23320221012311 |
11 | 7481060893933 |
12 | 27477469bb01b |
13 | 100211a050582 |
14 | 5a89c1a6dc7d |
15 | 2a692c10eb5b |
hex | 1535a97d5157 |
23320221012311 has 8 divisors (see below), whose sum is σ = 23415640177104. Its totient is φ = 23224821768000.
The previous prime is 23320221012299. The next prime is 23320221012313. The reversal of 23320221012311 is 11321012202332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23320221012311 - 226 = 23320153903447 is a prime.
It is a super-2 number, since 2×233202210123112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23320221012313) 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, 2631740 + ... + 7318913.
It is an arithmetic number, because the mean of its divisors is an integer number (2926955022138).
Almost surely, 223320221012311 is an apocalyptic number.
23320221012311 is a deficient number, since it is larger than the sum of its proper divisors (95419164793).
23320221012311 is an equidigital number, since it uses as much as digits as its factorization.
23320221012311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9960241.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 23320221012311 its reverse (11321012202332), we get a palindrome (34641233214643).
The spelling of 23320221012311 in words is "twenty-three trillion, three hundred twenty billion, two hundred twenty-one million, twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •