Base | Representation |
---|---|
bin | 1010010001111111110101… |
… | …1101000110111100000111 |
3 | 1111000200101212220110212021 |
4 | 2210133331131012330013 |
5 | 2440202212133101043 |
6 | 40013043501104011 |
7 | 2244465240661261 |
oct | 244377535067407 |
9 | 44020355813767 |
10 | 11304311222023 |
11 | 3669149a89116 |
12 | 1326a26b58007 |
13 | 63ccb84a0cc1 |
14 | 2b11bb0c2b31 |
15 | 1490b75b73ed |
hex | a47fd746f07 |
11304311222023 has 4 divisors (see below), whose sum is σ = 11304378025200. Its totient is φ = 11304244418848.
The previous prime is 11304311221969. The next prime is 11304311222081. The reversal of 11304311222023 is 32022211340311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11304311222023 is a prime.
It is a super-3 number, since 3×113043112220233 (a number of 40 digits) contains 333 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 (11304312222023) 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, 33147115 + ... + 33486412.
It is an arithmetic number, because the mean of its divisors is an integer number (2826094506300).
Almost surely, 211304311222023 is an apocalyptic number.
11304311222023 is a deficient number, since it is larger than the sum of its proper divisors (66803177).
11304311222023 is an equidigital number, since it uses as much as digits as its factorization.
11304311222023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66803176.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 11304311222023 its reverse (32022211340311), we get a palindrome (43326522562334).
The spelling of 11304311222023 in words is "eleven trillion, three hundred four billion, three hundred eleven million, two hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •