Base | Representation |
---|---|
bin | 10011010000001100… |
… | …00110111000110101 |
3 | 222200100200210201022 |
4 | 21220012012320311 |
5 | 132132102204013 |
6 | 4425400110525 |
7 | 514100443142 |
oct | 115006067065 |
9 | 28610623638 |
10 | 10336366133 |
11 | 4424677955 |
12 | 2005765445 |
13 | c895abaa2 |
14 | 700ac13c9 |
15 | 4076a2008 |
hex | 268186e35 |
10336366133 has 4 divisors (see below), whose sum is σ = 10358984460. Its totient is φ = 10313747808.
The previous prime is 10336366127. The next prime is 10336366141. The reversal of 10336366133 is 33166363301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 33166363301 = 13679 ⋅2424619.
It can be written as a sum of positive squares in 2 ways, for example, as 3767749924 + 6568616209 = 61382^2 + 81047^2 .
It is a cyclic number.
It is not a de Polignac number, because 10336366133 - 26 = 10336366069 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10336366093 and 10336366102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10336365133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11308478 + ... + 11309391.
It is an arithmetic number, because the mean of its divisors is an integer number (2589746115).
Almost surely, 210336366133 is an apocalyptic number.
It is an amenable number.
10336366133 is a deficient number, since it is larger than the sum of its proper divisors (22618327).
10336366133 is an equidigital number, since it uses as much as digits as its factorization.
10336366133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22618326.
The product of its (nonzero) digits is 52488, while the sum is 35.
The spelling of 10336366133 in words is "ten billion, three hundred thirty-six million, three hundred sixty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •