Base | Representation |
---|---|
bin | 10011011110010001… |
… | …10011111110010001 |
3 | 222222121000102022112 |
4 | 21233020303332101 |
5 | 132402323444401 |
6 | 4445220315105 |
7 | 520033626215 |
oct | 115710637621 |
9 | 28877012275 |
10 | 10454515601 |
11 | 4485335342 |
12 | 2039242a95 |
13 | ca7c0860a |
14 | 712678945 |
15 | 412c3e3bb |
hex | 26f233f91 |
10454515601 has 2 divisors, whose sum is σ = 10454515602. Its totient is φ = 10454515600.
The previous prime is 10454515529. The next prime is 10454515607. The reversal of 10454515601 is 10651545401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9290068225 + 1164447376 = 96385^2 + 34124^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10454515601 is a prime.
It is not a weakly prime, because it can be changed into another prime (10454515607) 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 as a sum of consecutive naturals, namely, 5227257800 + 5227257801.
It is an arithmetic number, because the mean of its divisors is an integer number (5227257801).
Almost surely, 210454515601 is an apocalyptic number.
It is an amenable number.
10454515601 is a deficient number, since it is larger than the sum of its proper divisors (1).
10454515601 is an equidigital number, since it uses as much as digits as its factorization.
10454515601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12000, while the sum is 32.
The spelling of 10454515601 in words is "ten billion, four hundred fifty-four million, five hundred fifteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.223 sec. • engine limits •