Base | Representation |
---|---|
bin | 10011000011101010… |
… | …10101001101001001 |
3 | 222102001000010222110 |
4 | 21201311111031021 |
5 | 131423203230113 |
6 | 4411124212533 |
7 | 511353441435 |
oct | 114165251511 |
9 | 28361003873 |
10 | 10231305033 |
11 | 43803399a4 |
12 | 1b9653a149 |
13 | c708b5761 |
14 | 6d0b739c5 |
15 | 3ed34cbc3 |
hex | 261d55349 |
10231305033 has 4 divisors (see below), whose sum is σ = 13641740048. Its totient is φ = 6820870020.
The previous prime is 10231304959. The next prime is 10231305043. The reversal of 10231305033 is 33050313201.
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: 33050313201 = 3 ⋅11016771067.
It is not a de Polignac number, because 10231305033 - 214 = 10231288649 is a prime.
It is a super-2 number, since 2×102313050332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10231305043) 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, 1705217503 + ... + 1705217508.
It is an arithmetic number, because the mean of its divisors is an integer number (3410435012).
Almost surely, 210231305033 is an apocalyptic number.
It is an amenable number.
10231305033 is a deficient number, since it is larger than the sum of its proper divisors (3410435015).
10231305033 is an equidigital number, since it uses as much as digits as its factorization.
10231305033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3410435014.
The product of its (nonzero) digits is 810, while the sum is 21.
Adding to 10231305033 its reverse (33050313201), we get a palindrome (43281618234).
The spelling of 10231305033 in words is "ten billion, two hundred thirty-one million, three hundred five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •