Base | Representation |
---|---|
bin | 1110010000101101000111… |
… | …0001000011001000100001 |
3 | 2001112000012121102120010121 |
4 | 3210023101301003020201 |
5 | 4023400421340121213 |
6 | 53203210023000241 |
7 | 3205565506161406 |
oct | 344132161031041 |
9 | 61460177376117 |
10 | 15680149926433 |
11 | 4aa5a069420a3 |
12 | 1912b02599081 |
13 | 89982a086355 |
14 | 3c2ccd7a02ad |
15 | 1c2d23c1888d |
hex | e42d1c43221 |
15680149926433 has 2 divisors, whose sum is σ = 15680149926434. Its totient is φ = 15680149926432.
The previous prime is 15680149926431. The next prime is 15680149926491. The reversal of 15680149926433 is 33462994108651.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12430757929984 + 3249391996449 = 3525728^2 + 1802607^2 .
It is a cyclic number.
It is not a de Polignac number, because 15680149926433 - 21 = 15680149926431 is a prime.
Together with 15680149926431, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (15680149926431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7840074963216 + 7840074963217.
It is an arithmetic number, because the mean of its divisors is an integer number (7840074963217).
Almost surely, 215680149926433 is an apocalyptic number.
It is an amenable number.
15680149926433 is a deficient number, since it is larger than the sum of its proper divisors (1).
15680149926433 is an equidigital number, since it uses as much as digits as its factorization.
15680149926433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 33592320, while the sum is 61.
The spelling of 15680149926433 in words is "fifteen trillion, six hundred eighty billion, one hundred forty-nine million, nine hundred twenty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •