Base | Representation |
---|---|
bin | 1011110101101000001011… |
… | …0111001010001111110101 |
3 | 1201002022102200110211100122 |
4 | 2331122002313022033311 |
5 | 3201223124234423403 |
6 | 43403235423221325 |
7 | 2512241166661550 |
oct | 275320267121765 |
9 | 51068380424318 |
10 | 13015946404853 |
11 | 4169039469787 |
12 | 15626b2147845 |
13 | 7355245c7a32 |
14 | 32dd91c05697 |
15 | 1788945e2838 |
hex | bd682dca3f5 |
13015946404853 has 4 divisors (see below), whose sum is σ = 14875367319840. Its totient is φ = 11156525489868.
The previous prime is 13015946404849. The next prime is 13015946404883. The reversal of 13015946404853 is 35840464951031.
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 13015946404853 - 22 = 13015946404849 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13015946404795 and 13015946404804.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13015946404883) 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, 929710457483 + ... + 929710457496.
It is an arithmetic number, because the mean of its divisors is an integer number (3718841829960).
Almost surely, 213015946404853 is an apocalyptic number.
It is an amenable number.
13015946404853 is a deficient number, since it is larger than the sum of its proper divisors (1859420914987).
13015946404853 is an equidigital number, since it uses as much as digits as its factorization.
13015946404853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1859420914986.
The product of its (nonzero) digits is 6220800, while the sum is 53.
The spelling of 13015946404853 in words is "thirteen trillion, fifteen billion, nine hundred forty-six million, four hundred four thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •