Base | Representation |
---|---|
bin | 10011001011111110… |
… | …00100001100100110 |
3 | 222120220002021102001 |
4 | 21211333010030212 |
5 | 132044021400140 |
6 | 4422053235514 |
7 | 513160522612 |
oct | 114577041446 |
9 | 28526067361 |
10 | 10300965670 |
11 | 4406698a76 |
12 | 1bb5932b9a |
13 | c82165978 |
14 | 6da108342 |
15 | 40450ce9a |
hex | 265fc4326 |
10300965670 has 16 divisors (see below), whose sum is σ = 18561713760. Its totient is φ = 4115947264.
The previous prime is 10300965667. The next prime is 10300965673. The reversal of 10300965670 is 7656900301.
10300965670 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10300965667) and next prime (10300965673).
It is a super-2 number, since 2×103009656702 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10300965673) 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 in 7 ways as a sum of consecutive naturals, for example, 545122 + ... + 563701.
It is an arithmetic number, because the mean of its divisors is an integer number (1160107110).
Almost surely, 210300965670 is an apocalyptic number.
10300965670 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10300965670 is a deficient number, since it is larger than the sum of its proper divisors (8260748090).
10300965670 is a wasteful number, since it uses less digits than its factorization.
10300965670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1109759.
The product of its (nonzero) digits is 34020, while the sum is 37.
The spelling of 10300965670 in words is "ten billion, three hundred million, nine hundred sixty-five thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •