Base | Representation |
---|---|
bin | 1011000011011000010111… |
… | …1100100100000010100101 |
3 | 1121000210021020100222110001 |
4 | 2300312011330210002211 |
5 | 3043102222142220443 |
6 | 41502513333301301 |
7 | 2363001322166446 |
oct | 260660574440245 |
9 | 47023236328401 |
10 | 12152709726373 |
11 | 3965a31902537 |
12 | 1443339a94831 |
13 | 6a1cc347c918 |
14 | 3002a11b52cd |
15 | 1611be856d4d |
hex | b0d85f240a5 |
12152709726373 has 4 divisors (see below), whose sum is σ = 12168151543840. Its totient is φ = 12137267908908.
The previous prime is 12152709726371. The next prime is 12152709726379. The reversal of 12152709726373 is 37362790725121.
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 not a de Polignac number, because 12152709726373 - 21 = 12152709726371 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 (12152709726371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7720907553 + ... + 7720909126.
It is an arithmetic number, because the mean of its divisors is an integer number (3042037885960).
Almost surely, 212152709726373 is an apocalyptic number.
It is an amenable number.
12152709726373 is a deficient number, since it is larger than the sum of its proper divisors (15441817467).
12152709726373 is an equidigital number, since it uses as much as digits as its factorization.
12152709726373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15441817466.
The product of its (nonzero) digits is 6667920, while the sum is 55.
The spelling of 12152709726373 in words is "twelve trillion, one hundred fifty-two billion, seven hundred nine million, seven hundred twenty-six thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •