Base | Representation |
---|---|
bin | 10000011110100010100… |
… | …001111111111000001001 |
3 | 11000020200011021101021221 |
4 | 100132202201333320021 |
5 | 122022424111021413 |
6 | 2224101203402041 |
7 | 144543346366123 |
oct | 20364241777011 |
9 | 4006604241257 |
10 | 1132303220233 |
11 | 3a7230715519 |
12 | 163546083321 |
13 | 82a113a2183 |
14 | 3cb3777c213 |
15 | 1e6c18d568d |
hex | 107a287fe09 |
1132303220233 has 16 divisors (see below), whose sum is σ = 1169626215744. Its totient is φ = 1095459523840.
The previous prime is 1132303220231. The next prime is 1132303220281. The reversal of 1132303220233 is 3320223032311.
It is a cyclic number.
It is not a de Polignac number, because 1132303220233 - 21 = 1132303220231 is a prime.
It is a super-2 number, since 2×11323032202332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1132303220198 and 1132303220207.
It is not an unprimeable number, because it can be changed into a prime (1132303220231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5212866 + ... + 5425732.
It is an arithmetic number, because the mean of its divisors is an integer number (73101638484).
Almost surely, 21132303220233 is an apocalyptic number.
It is an amenable number.
1132303220233 is a deficient number, since it is larger than the sum of its proper divisors (37322995511).
1132303220233 is a wasteful number, since it uses less digits than its factorization.
1132303220233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 213992.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 1132303220233 its reverse (3320223032311), we get a palindrome (4452526252544).
The spelling of 1132303220233 in words is "one trillion, one hundred thirty-two billion, three hundred three million, two hundred twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •