Base | Representation |
---|---|
bin | 10011001111011101… |
… | …01101100100011001 |
3 | 222122221011012210102 |
4 | 21213232231210121 |
5 | 132124014424423 |
6 | 4425020425145 |
7 | 513664350464 |
oct | 114756554431 |
9 | 28587135712 |
10 | 10330233113 |
11 | 4421169042 |
12 | 20036a81b5 |
13 | c88242395 |
14 | 6ddd662db |
15 | 406d8ec28 |
hex | 267bad919 |
10330233113 has 4 divisors (see below), whose sum is σ = 10331144208. Its totient is φ = 10329322020.
The previous prime is 10330233103. The next prime is 10330233119. The reversal of 10330233113 is 31133203301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31133203301 = 73 ⋅426482237.
It is a cyclic number.
It is not a de Polignac number, because 10330233113 - 210 = 10330232089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10330233119) 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 3 ways as a sum of consecutive naturals, for example, 438323 + ... + 461288.
It is an arithmetic number, because the mean of its divisors is an integer number (2582786052).
Almost surely, 210330233113 is an apocalyptic number.
It is an amenable number.
10330233113 is a deficient number, since it is larger than the sum of its proper divisors (911095).
10330233113 is an equidigital number, since it uses as much as digits as its factorization.
10330233113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 911094.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 10330233113 its reverse (31133203301), we get a palindrome (41463436414).
The spelling of 10330233113 in words is "ten billion, three hundred thirty million, two hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •