Base | Representation |
---|---|
bin | 11101000110110011110101… |
… | …101101010000100100001001 |
3 | 121210020202121111222201200002 |
4 | 131012303311231100210021 |
5 | 113234314144324302413 |
6 | 1132131331514052345 |
7 | 35651341014033350 |
oct | 3506636555204411 |
9 | 553222544881602 |
10 | 128011327572233 |
11 | 37874332191096 |
12 | 1243555271a0b5 |
13 | 5657554a7b1a1 |
14 | 2387ad1ccc997 |
15 | ebed05cb3958 |
hex | 746cf5b50909 |
128011327572233 has 8 divisors (see below), whose sum is σ = 146306487456960. Its totient is φ = 109718124531120.
The previous prime is 128011327572179. The next prime is 128011327572239. The reversal of 128011327572233 is 332275723110821.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 128011327572233 - 28 = 128011327571977 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (128011327572239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 489070718 + ... + 489332391.
It is an arithmetic number, because the mean of its divisors is an integer number (18288310932120).
Almost surely, 2128011327572233 is an apocalyptic number.
It is an amenable number.
128011327572233 is a deficient number, since it is larger than the sum of its proper divisors (18295159884727).
128011327572233 is an equidigital number, since it uses as much as digits as its factorization.
128011327572233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 978421807.
The product of its (nonzero) digits is 846720, while the sum is 47.
The spelling of 128011327572233 in words is "one hundred twenty-eight trillion, eleven billion, three hundred twenty-seven million, five hundred seventy-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •