Base | Representation |
---|---|
bin | 10011110100100010… |
… | …10101101111101101 |
3 | 1000110121111001222022 |
4 | 21322101111233231 |
5 | 133243133103321 |
6 | 4515531555525 |
7 | 524462363411 |
oct | 117221255755 |
9 | 30417431868 |
10 | 10641300461 |
11 | 45708115a0 |
12 | 208b8bbba5 |
13 | 10078167bc |
14 | 72d3bad41 |
15 | 424337dab |
hex | 27a455bed |
10641300461 has 8 divisors (see below), whose sum is σ = 11609442624. Its totient is φ = 9673283520.
The previous prime is 10641300457. The next prime is 10641300473. The reversal of 10641300461 is 16400314601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10641300461 - 22 = 10641300457 is a prime.
It is a super-2 number, since 2×106413004612 (a number of 21 digits) contains 22 as substring.
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 10641300461.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10641300401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 288320 + ... + 323126.
It is an arithmetic number, because the mean of its divisors is an integer number (1451180328).
Almost surely, 210641300461 is an apocalyptic number.
10641300461 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10641300461 is a deficient number, since it is larger than the sum of its proper divisors (968142163).
10641300461 is a wasteful number, since it uses less digits than its factorization.
10641300461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62611.
The product of its (nonzero) digits is 1728, while the sum is 26.
The spelling of 10641300461 in words is "ten billion, six hundred forty-one million, three hundred thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •