Base | Representation |
---|---|
bin | 10010101100000001… |
… | …11110111100110101 |
3 | 221220012220212220022 |
4 | 21112000332330311 |
5 | 131021424024023 |
6 | 4335322414525 |
7 | 503425242053 |
oct | 112600767465 |
9 | 27805825808 |
10 | 10033033013 |
11 | 4289427223 |
12 | 1b40061445 |
13 | c3b7b4b33 |
14 | 6b26c11d3 |
15 | 3dac357c8 |
hex | 25603ef35 |
10033033013 has 4 divisors (see below), whose sum is σ = 10203084480. Its totient is φ = 9862981548.
The previous prime is 10033032991. The next prime is 10033033063. The reversal of 10033033013 is 31033033001.
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: 31033033001 = 181 ⋅171453221.
It is a cyclic number.
It is not a de Polignac number, because 10033033013 - 214 = 10033016629 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10033032982 and 10033033000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10033033063) 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, 85025645 + ... + 85025762.
It is an arithmetic number, because the mean of its divisors is an integer number (2550771120).
Almost surely, 210033033013 is an apocalyptic number.
It is an amenable number.
10033033013 is a deficient number, since it is larger than the sum of its proper divisors (170051467).
10033033013 is an equidigital number, since it uses as much as digits as its factorization.
10033033013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 170051466.
The product of its (nonzero) digits is 243, while the sum is 17.
Adding to 10033033013 its reverse (31033033001), we get a palindrome (41066066014).
The spelling of 10033033013 in words is "ten billion, thirty-three million, thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •