Base | Representation |
---|---|
bin | 10011001011111110… |
… | …10011000010011101 |
3 | 222120220012100210120 |
4 | 21211333103002131 |
5 | 132044030321321 |
6 | 4422054425153 |
7 | 513161165055 |
oct | 114577230235 |
9 | 28526170716 |
10 | 10301026461 |
11 | 440672a710 |
12 | 1bb59621b9 |
13 | c8218753b |
14 | 6da122565 |
15 | 404520ec6 |
hex | 265fd309d |
10301026461 has 64 divisors (see below), whose sum is σ = 16576876800. Its totient is φ = 5616128000.
The previous prime is 10301026451. The next prime is 10301026469. The reversal of 10301026461 is 16462010301.
It is a cyclic number.
It is not a de Polignac number, because 10301026461 - 25 = 10301026429 is a prime.
It is a super-2 number, since 2×103010264612 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10301026469) 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 in 63 ways as a sum of consecutive naturals, for example, 1640035 + ... + 1646303.
It is an arithmetic number, because the mean of its divisors is an integer number (259013700).
Almost surely, 210301026461 is an apocalyptic number.
10301026461 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10301026461 is a deficient number, since it is larger than the sum of its proper divisors (6275850339).
10301026461 is a wasteful number, since it uses less digits than its factorization.
10301026461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6430.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 10301026461 its reverse (16462010301), we get a palindrome (26763036762).
The spelling of 10301026461 in words is "ten billion, three hundred one million, twenty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •