Base | Representation |
---|---|
bin | 100100101111110… |
… | …0110010011010001 |
3 | 10011221010220121121 |
4 | 1021133212103101 |
5 | 10011123120423 |
6 | 322203522241 |
7 | 42361332553 |
oct | 11137462321 |
9 | 3157126547 |
10 | 1233020113 |
11 | 58300a296 |
12 | 2a4b29381 |
13 | 1685b6000 |
14 | b9a874d3 |
15 | 733ae45d |
hex | 497e64d1 |
1233020113 has 8 divisors (see below), whose sum is σ = 1335727400. Its totient is φ = 1138170384.
The previous prime is 1233020051. The next prime is 1233020161. The reversal of 1233020113 is 3110203321.
It can be written as a sum of positive squares in 4 ways, for example, as 600397009 + 632623104 = 24503^2 + 25152^2 .
It is not a de Polignac number, because 1233020113 - 217 = 1232889041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1233020213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 278418 + ... + 282811.
It is an arithmetic number, because the mean of its divisors is an integer number (166965925).
Almost surely, 21233020113 is an apocalyptic number.
1233020113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1233020113 is a deficient number, since it is larger than the sum of its proper divisors (102707287).
1233020113 is an frugal number, since it uses more digits than its factorization.
1233020113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 561268 (or 561242 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 1233020113 is about 35114.3861259171. The cubic root of 1233020113 is about 1072.3174834807.
Adding to 1233020113 its reverse (3110203321), we get a palindrome (4343223434).
The spelling of 1233020113 in words is "one billion, two hundred thirty-three million, twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •