Base | Representation |
---|---|
bin | 100111000001… |
… | …000011011101 |
3 | 201020122002100 |
4 | 213001003131 |
5 | 10104243213 |
6 | 1003115313 |
7 | 152636022 |
oct | 47010335 |
9 | 21218070 |
10 | 10227933 |
11 | 5856441 |
12 | 3512b39 |
13 | 2171541 |
14 | 1503549 |
15 | d70773 |
hex | 9c10dd |
10227933 has 12 divisors (see below), whose sum is σ = 14861340. Its totient is φ = 6778176.
The previous prime is 10227929. The next prime is 10227953. The reversal of 10227933 is 33972201.
It can be written as a sum of positive squares in 2 ways, for example, as 9253764 + 974169 = 3042^2 + 987^2 .
It is not a de Polignac number, because 10227933 - 22 = 10227929 is a prime.
It is a super-2 number, since 2×102279332 = 209221226904978, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10227897 and 10227906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10227913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1728 + ... + 4841.
It is an arithmetic number, because the mean of its divisors is an integer number (1238445).
Almost surely, 210227933 is an apocalyptic number.
It is an amenable number.
10227933 is a deficient number, since it is larger than the sum of its proper divisors (4633407).
10227933 is a wasteful number, since it uses less digits than its factorization.
10227933 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6748 (or 6745 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The square root of 10227933 is about 3198.1139754549. The cubic root of 10227933 is about 217.0680766398.
The spelling of 10227933 in words is "ten million, two hundred twenty-seven thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •