Base | Representation |
---|---|
bin | 10011001111011110… |
… | …00000101010001110 |
3 | 222122221022012001121 |
4 | 21213233000222032 |
5 | 132124024430220 |
6 | 4425022231154 |
7 | 513665124454 |
oct | 114757005216 |
9 | 28587265047 |
10 | 10330311310 |
11 | 4421211870 |
12 | 20037254ba |
13 | c8826bb57 |
14 | 6ddd869d4 |
15 | 406da7eaa |
hex | 267bc0a8e |
10330311310 has 64 divisors (see below), whose sum is σ = 21377032704. Its totient is φ = 3557488000.
The previous prime is 10330311281. The next prime is 10330311331. The reversal of 10330311310 is 1311303301.
10330311310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×103303113102 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 235317 + ... + 275743.
It is an arithmetic number, because the mean of its divisors is an integer number (334016136).
Almost surely, 210330311310 is an apocalyptic number.
10330311310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10330311310 is an abundant number, since it is smaller than the sum of its proper divisors (11046721394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10330311310 is a wasteful number, since it uses less digits than its factorization.
10330311310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40569.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 10330311310 its reverse (1311303301), we get a palindrome (11641614611).
The spelling of 10330311310 in words is "ten billion, three hundred thirty million, three hundred eleven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •