Base | Representation |
---|---|
bin | 1011111011110100011111… |
… | …1100000000101011001111 |
3 | 1201110111000212202011112021 |
4 | 2332331013330000223033 |
5 | 3204444013443044043 |
6 | 43524152135551011 |
7 | 2523025422435415 |
oct | 276750774005317 |
9 | 51414025664467 |
10 | 13122332003023 |
11 | 41aa171354241 |
12 | 157b24252b467 |
13 | 74257a041519 |
14 | 3351a4d6b2b5 |
15 | 17b51e2313ed |
hex | bef47f00acf |
13122332003023 has 4 divisors (see below), whose sum is σ = 13135573509568. Its totient is φ = 13109090496480.
The previous prime is 13122332003017. The next prime is 13122332003059. The reversal of 13122332003023 is 32030023322131.
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-13122332003023 is a prime.
It is a super-2 number, since 2×131223320030232 (a number of 27 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 (13122332003063) 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, 6620751786 + ... + 6620753767.
It is an arithmetic number, because the mean of its divisors is an integer number (3283893377392).
Almost surely, 213122332003023 is an apocalyptic number.
13122332003023 is a deficient number, since it is larger than the sum of its proper divisors (13241506545).
13122332003023 is an equidigital number, since it uses as much as digits as its factorization.
13122332003023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13241506544.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 13122332003023 its reverse (32030023322131), we get a palindrome (45152355325154).
The spelling of 13122332003023 in words is "thirteen trillion, one hundred twenty-two billion, three hundred thirty-two million, three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •