Base | Representation |
---|---|
bin | 111110000010101000… |
… | …0001000011010011111 |
3 | 110201220011200222201010 |
4 | 1330011100020122133 |
5 | 4140324404213043 |
6 | 141112254150303 |
7 | 12424421113260 |
oct | 1740520103237 |
9 | 421804628633 |
10 | 133232101023 |
11 | 5155a0584aa |
12 | 219a31b2393 |
13 | c7436a2748 |
14 | 663c84c967 |
15 | 36eb9a3133 |
hex | 1f0540869f |
133232101023 has 16 divisors (see below), whose sum is σ = 203042105856. Its totient is φ = 76124468640.
The previous prime is 133232101019. The next prime is 133232101027. The reversal of 133232101023 is 320101232331.
It is an interprime number because it is at equal distance from previous prime (133232101019) and next prime (133232101027).
It is not a de Polignac number, because 133232101023 - 22 = 133232101019 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133232101027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 136611 + ... + 533972.
It is an arithmetic number, because the mean of its divisors is an integer number (12690131616).
Almost surely, 2133232101023 is an apocalyptic number.
133232101023 is a deficient number, since it is larger than the sum of its proper divisors (69810004833).
133232101023 is an equidigital number, since it uses as much as digits as its factorization.
133232101023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680054.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 133232101023 its reverse (320101232331), we get a palindrome (453333333354).
The spelling of 133232101023 in words is "one hundred thirty-three billion, two hundred thirty-two million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •