Base | Representation |
---|---|
bin | 1011111011101101000000… |
… | …0010000011110111001111 |
3 | 1201110021211200102020100121 |
4 | 2332323100002003313033 |
5 | 3204430404000314043 |
6 | 43523220354405411 |
7 | 2522624524436224 |
oct | 276732002036717 |
9 | 51407750366317 |
10 | 13120320323023 |
11 | 41a932985a291 |
12 | 157a980890867 |
13 | 742319337a24 |
14 | 335053b1194b |
15 | 17b452812ded |
hex | beed0083dcf |
13120320323023 has 4 divisors (see below), whose sum is σ = 13123274689168. Its totient is φ = 13117365956880.
The previous prime is 13120320322999. The next prime is 13120320323053. The reversal of 13120320323023 is 32032302302131.
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 13120320323023 - 221 = 13120318225871 is a prime.
It is a super-3 number, since 3×131203203230233 (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 (13120320323053) 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, 1477176411 + ... + 1477185292.
It is an arithmetic number, because the mean of its divisors is an integer number (3280818672292).
Almost surely, 213120320323023 is an apocalyptic number.
13120320323023 is a deficient number, since it is larger than the sum of its proper divisors (2954366145).
13120320323023 is an equidigital number, since it uses as much as digits as its factorization.
13120320323023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2954366144.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 13120320323023 its reverse (32032302302131), we get a palindrome (45152622625154).
The spelling of 13120320323023 in words is "thirteen trillion, one hundred twenty billion, three hundred twenty million, three hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •