Base | Representation |
---|---|
bin | 10000011110010001110… |
… | …101100011010010010101 |
3 | 11000012221122020111022001 |
4 | 100132101311203102111 |
5 | 122021340410231313 |
6 | 2224013320235301 |
7 | 144533405604211 |
oct | 20362165432225 |
9 | 4005848214261 |
10 | 1132023133333 |
11 | 3a70a7602044 |
12 | 16348830bb31 |
13 | 82998357091 |
14 | 3cb0c4ad941 |
15 | 1e6a700badd |
hex | 10791d63495 |
1132023133333 has 8 divisors (see below), whose sum is σ = 1140962300928. Its totient is φ = 1123084365984.
The previous prime is 1132023133327. The next prime is 1132023133337. The reversal of 1132023133333 is 3333313202311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1132023133333 - 213 = 1132023125141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132023133337) 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 7 ways as a sum of consecutive naturals, for example, 8447985 + ... + 8580937.
It is an arithmetic number, because the mean of its divisors is an integer number (142620287616).
Almost surely, 21132023133333 is an apocalyptic number.
It is an amenable number.
1132023133333 is a deficient number, since it is larger than the sum of its proper divisors (8939167595).
1132023133333 is a wasteful number, since it uses less digits than its factorization.
1132023133333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200123.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 1132023133333 its reverse (3333313202311), we get a palindrome (4465336335644).
The spelling of 1132023133333 in words is "one trillion, one hundred thirty-two billion, twenty-three million, one hundred thirty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •