Base | Representation |
---|---|
bin | 1011111011111010001111… |
… | …0101001010100011111101 |
3 | 1201110122000022202010011212 |
4 | 2332332203311022203331 |
5 | 3210010143132244011 |
6 | 43525005132054205 |
7 | 2523111552651035 |
oct | 276764365124375 |
9 | 51418008663155 |
10 | 13123873712381 |
11 | 41aa892632303 |
12 | 157b5b2904365 |
13 | 742764578393 |
14 | 3352ada0a8c5 |
15 | 17b5ae76908b |
hex | befa3d4a8fd |
13123873712381 has 4 divisors (see below), whose sum is σ = 13123980309600. Its totient is φ = 13123767115164.
The previous prime is 13123873712371. The next prime is 13123873712413. The reversal of 13123873712381 is 18321737832131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13123873712381 is a prime.
It is a super-2 number, since 2×131238737123812 (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 (13123873712371) 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, 53113721 + ... + 53360238.
It is an arithmetic number, because the mean of its divisors is an integer number (3280995077400).
Almost surely, 213123873712381 is an apocalyptic number.
It is an amenable number.
13123873712381 is a deficient number, since it is larger than the sum of its proper divisors (106597219).
13123873712381 is a wasteful number, since it uses less digits than its factorization.
13123873712381 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106597218.
The product of its digits is 1016064, while the sum is 50.
The spelling of 13123873712381 in words is "thirteen trillion, one hundred twenty-three billion, eight hundred seventy-three million, seven hundred twelve thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •