Base | Representation |
---|---|
bin | 10011001111110101… |
… | …00001101011010011 |
3 | 222200010222120002210 |
4 | 21213322201223103 |
5 | 132130313031011 |
6 | 4425211043203 |
7 | 514032566625 |
oct | 114772415323 |
9 | 28603876083 |
10 | 10333330131 |
11 | 4422993963 |
12 | 2004740503 |
13 | c88a87c37 |
14 | 700530c15 |
15 | 4072a26a6 |
hex | 267ea1ad3 |
10333330131 has 8 divisors (see below), whose sum is σ = 13971826944. Its totient is φ = 6791860040.
The previous prime is 10333330127. The next prime is 10333330159. The reversal of 10333330131 is 13103333301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10333330131 - 22 = 10333330127 is a prime.
It is a super-2 number, since 2×103333301312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10333330098 and 10333330107.
It is not an unprimeable number, because it can be changed into a prime (10333330331) 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 7 ways as a sum of consecutive naturals, for example, 24256431 + ... + 24256856.
It is an arithmetic number, because the mean of its divisors is an integer number (1746478368).
Almost surely, 210333330131 is an apocalyptic number.
10333330131 is a deficient number, since it is larger than the sum of its proper divisors (3638496813).
10333330131 is an equidigital number, since it uses as much as digits as its factorization.
10333330131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48513361.
The product of its (nonzero) digits is 729, while the sum is 21.
Adding to 10333330131 its reverse (13103333301), we get a palindrome (23436663432).
The spelling of 10333330131 in words is "ten billion, three hundred thirty-three million, three hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •