Base | Representation |
---|---|
bin | 10011001111011110… |
… | …00101010100101101 |
3 | 222122221100011021010 |
4 | 21213233011110231 |
5 | 132124031033123 |
6 | 4425022455433 |
7 | 513665234244 |
oct | 114757052455 |
9 | 28587304233 |
10 | 10330330413 |
11 | 4421225157 |
12 | 2003734579 |
13 | c88277760 |
14 | 6ddd8d95b |
15 | 406dad993 |
hex | 267bc552d |
10330330413 has 16 divisors (see below), whose sum is σ = 14836075520. Its totient is φ = 6355934784.
The previous prime is 10330330411. The next prime is 10330330427. The reversal of 10330330413 is 31403303301.
It is not a de Polignac number, because 10330330413 - 21 = 10330330411 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10330330413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10330330411) 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 15 ways as a sum of consecutive naturals, for example, 215295 + ... + 258867.
It is an arithmetic number, because the mean of its divisors is an integer number (927254720).
Almost surely, 210330330413 is an apocalyptic number.
10330330413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10330330413 is a deficient number, since it is larger than the sum of its proper divisors (4505745107).
10330330413 is a wasteful number, since it uses less digits than its factorization.
10330330413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49668.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 10330330413 its reverse (31403303301), we get a palindrome (41733633714).
The spelling of 10330330413 in words is "ten billion, three hundred thirty million, three hundred thirty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •