Base | Representation |
---|---|
bin | 10011001101011100… |
… | …01100011110001010 |
3 | 222121202022221211001 |
4 | 21212232030132022 |
5 | 132110202222310 |
6 | 4423214125214 |
7 | 513400530205 |
oct | 114656143612 |
9 | 28552287731 |
10 | 10313320330 |
11 | 4412667235 |
12 | 1bb9ab080a |
13 | c848a0211 |
14 | 6dba0293c |
15 | 40564d93a |
hex | 266b8c78a |
10313320330 has 16 divisors (see below), whose sum is σ = 18755359560. Its totient is φ = 4082798592.
The previous prime is 10313320321. The next prime is 10313320331. The reversal of 10313320330 is 3302331301.
10313320330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 9868236921 + 445083409 = 99339^2 + 21097^2 .
It is a junction number, because it is equal to n+sod(n) for n = 10313320298 and 10313320307.
It is not an unprimeable number, because it can be changed into a prime (10313320331) 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, 5315175 + ... + 5317114.
Almost surely, 210313320330 is an apocalyptic number.
10313320330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10313320330 is a deficient number, since it is larger than the sum of its proper divisors (8442039230).
10313320330 is a wasteful number, since it uses less digits than its factorization.
10313320330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10632393.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 10313320330 its reverse (3302331301), we get a palindrome (13615651631).
The spelling of 10313320330 in words is "ten billion, three hundred thirteen million, three hundred twenty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •