Base | Representation |
---|---|
bin | 10010110011100010… |
… | …01110000101011001 |
3 | 222001121102102111001 |
4 | 21121301032011121 |
5 | 131134034301221 |
6 | 4345452305001 |
7 | 505121444131 |
oct | 113161160531 |
9 | 28047372431 |
10 | 10096009561 |
11 | 4310a30460 |
12 | 1b59172161 |
13 | c4b864871 |
14 | 6babd5ac1 |
15 | 3e1525391 |
hex | 259c4e159 |
10096009561 has 4 divisors (see below), whose sum is σ = 11013828624. Its totient is φ = 9178190500.
The previous prime is 10096009541. The next prime is 10096009577. The reversal of 10096009561 is 16590069001.
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, and also an emirpimes, since its reverse is a distinct semiprime: 16590069001 = 11 ⋅1508188091.
It is a cyclic number.
It is not a de Polignac number, because 10096009561 - 27 = 10096009433 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10096009561.
It is not an unprimeable number, because it can be changed into a prime (10096009541) 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, 458909515 + ... + 458909536.
It is an arithmetic number, because the mean of its divisors is an integer number (2753457156).
Almost surely, 210096009561 is an apocalyptic number.
10096009561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10096009561 is a deficient number, since it is larger than the sum of its proper divisors (917819063).
10096009561 is an equidigital number, since it uses as much as digits as its factorization.
10096009561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 917819062.
The product of its (nonzero) digits is 14580, while the sum is 37.
The spelling of 10096009561 in words is "ten billion, ninety-six million, nine thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •