Base | Representation |
---|---|
bin | 10011000011100001… |
… | …10001110001100101 |
3 | 222101221202111112100 |
4 | 21201300301301211 |
5 | 131422402030313 |
6 | 4411042442313 |
7 | 511340340321 |
oct | 114160616145 |
9 | 28357674470 |
10 | 10230111333 |
11 | 437a6a4072 |
12 | 1b96063399 |
13 | c70588320 |
14 | 6d0942981 |
15 | 3ed1b4173 |
hex | 261c31c65 |
10230111333 has 24 divisors (see below), whose sum is σ = 15941191448. Its totient is φ = 6284500992.
The previous prime is 10230111329. The next prime is 10230111337. The reversal of 10230111333 is 33311103201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10230111329) and next prime (10230111337).
It can be written as a sum of positive squares in 4 ways, for example, as 3424356324 + 6805755009 = 58518^2 + 82497^2 .
It is not a de Polignac number, because 10230111333 - 22 = 10230111329 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10230111337) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8260 + ... + 143277.
Almost surely, 210230111333 is an apocalyptic number.
10230111333 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10230111333 is a deficient number, since it is larger than the sum of its proper divisors (5711080115).
10230111333 is a wasteful number, since it uses less digits than its factorization.
10230111333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152133 (or 152130 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 10230111333 its reverse (33311103201), we get a palindrome (43541214534).
The spelling of 10230111333 in words is "ten billion, two hundred thirty million, one hundred eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •