Base | Representation |
---|---|
bin | 1010100000111100001000… |
… | …11101100100111011010111 |
3 | 10000212110000010011010210011 |
4 | 11100132010131210323113 |
5 | 11012312410003102221 |
6 | 121102040423541051 |
7 | 4604340330145516 |
oct | 520360435447327 |
9 | 100773003133704 |
10 | 23122031300311 |
11 | 7404aa8973919 |
12 | 27152555ba787 |
13 | cb9523ab4138 |
14 | 59d18018267d |
15 | 2a16cca771e1 |
hex | 150784764ed7 |
23122031300311 has 4 divisors (see below), whose sum is σ = 23130321741000. Its totient is φ = 23113740859624.
The previous prime is 23122031300293. The next prime is 23122031300317. The reversal of 23122031300311 is 11300313022132.
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 23122031300311 - 243 = 14325938278103 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 (23122031300317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4145216161 + ... + 4145221738.
It is an arithmetic number, because the mean of its divisors is an integer number (5782580435250).
Almost surely, 223122031300311 is an apocalyptic number.
23122031300311 is a deficient number, since it is larger than the sum of its proper divisors (8290440689).
23122031300311 is an equidigital number, since it uses as much as digits as its factorization.
23122031300311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8290440688.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 23122031300311 its reverse (11300313022132), we get a palindrome (34422344322443).
The spelling of 23122031300311 in words is "twenty-three trillion, one hundred twenty-two billion, thirty-one million, three hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •