Base | Representation |
---|---|
bin | 10001111100100010011… |
… | …010111100100100001001 |
3 | 11100220012010122200001022 |
4 | 101330202122330210021 |
5 | 130201130133244423 |
6 | 2342312305202225 |
7 | 155045444263334 |
oct | 21744232744411 |
9 | 4326163580038 |
10 | 1233233103113 |
11 | 436013a33370 |
12 | 17b013330375 |
13 | 8c3a773bb6b |
14 | 439900d761b |
15 | 2212c5a0dc8 |
hex | 11f226bc909 |
1233233103113 has 32 divisors (see below), whose sum is σ = 1423710950400. Its totient is φ = 1056458894400.
The previous prime is 1233233103079. The next prime is 1233233103199. The reversal of 1233233103113 is 3113013323321.
It is a cyclic number.
It is not a de Polignac number, because 1233233103113 - 222 = 1233228908809 is a prime.
It is a super-2 number, since 2×12332331031132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1233233108113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35458070 + ... + 35492832.
It is an arithmetic number, because the mean of its divisors is an integer number (44490967200).
Almost surely, 21233233103113 is an apocalyptic number.
It is an amenable number.
1233233103113 is a deficient number, since it is larger than the sum of its proper divisors (190477847287).
1233233103113 is a wasteful number, since it uses less digits than its factorization.
1233233103113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35693.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 1233233103113 its reverse (3113013323321), we get a palindrome (4346246426434).
The spelling of 1233233103113 in words is "one trillion, two hundred thirty-three billion, two hundred thirty-three million, one hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •