Base | Representation |
---|---|
bin | 111110000010010010… |
… | …1110010001101010111 |
3 | 110201212101210222222222 |
4 | 1330010211302031113 |
5 | 4140314034000043 |
6 | 141111220212555 |
7 | 12424224546656 |
oct | 1740445621527 |
9 | 421771728888 |
10 | 133221000023 |
11 | 51553866121 |
12 | 2199b53a15b |
13 | c7412b69c7 |
14 | 663b19d19d |
15 | 36eaa0dd68 |
hex | 1f04972357 |
133221000023 has 8 divisors (see below), whose sum is σ = 139755883680. Its totient is φ = 126815520160.
The previous prime is 133220999917. The next prime is 133221000097. The reversal of 133221000023 is 320000122331.
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 133221000023 - 28 = 133220999767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133220999965 and 133221000010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133221002023) 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, 32348840 + ... + 32352957.
It is an arithmetic number, because the mean of its divisors is an integer number (17469485460).
Almost surely, 2133221000023 is an apocalyptic number.
133221000023 is a deficient number, since it is larger than the sum of its proper divisors (6534883657).
133221000023 is an equidigital number, since it uses as much as digits as its factorization.
133221000023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64701897.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 133221000023 its reverse (320000122331), we get a palindrome (453221122354).
The spelling of 133221000023 in words is "one hundred thirty-three billion, two hundred twenty-one million, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •