Base | Representation |
---|---|
bin | 111101011110100000… |
… | …0110000011010101111 |
3 | 110121202201010111222121 |
4 | 1322331000300122233 |
5 | 4130334122023043 |
6 | 140352121053411 |
7 | 12352403266603 |
oct | 1727500603257 |
9 | 417681114877 |
10 | 132020111023 |
11 | 50a97a02479 |
12 | 21705327267 |
13 | c5ac5709b8 |
14 | 65658bb503 |
15 | 367a399ded |
hex | 1ebd0306af |
132020111023 has 8 divisors (see below), whose sum is σ = 134996671008. Its totient is φ = 129061536864.
The previous prime is 132020110961. The next prime is 132020111057. The reversal of 132020111023 is 320111020231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132020111023 is a prime.
It is a super-2 number, since 2×1320201110232 (a number of 23 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 = 132020110988 and 132020111006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132020111723) 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, 4481611 + ... + 4510972.
It is an arithmetic number, because the mean of its divisors is an integer number (16874583876).
Almost surely, 2132020111023 is an apocalyptic number.
132020111023 is a deficient number, since it is larger than the sum of its proper divisors (2976559985).
132020111023 is an equidigital number, since it uses as much as digits as its factorization.
132020111023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8992913.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 132020111023 its reverse (320111020231), we get a palindrome (452131131254).
The spelling of 132020111023 in words is "one hundred thirty-two billion, twenty million, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •