Base | Representation |
---|---|
bin | 1010010011100111000111… |
… | …0011110000011111001001 |
3 | 1111010022221212112211000211 |
4 | 2210321301303300133021 |
5 | 2441131000434321301 |
6 | 40033510353401121 |
7 | 2246466226141663 |
oct | 244716163603711 |
9 | 44108855484024 |
10 | 11332033120201 |
11 | 36799852a8572 |
12 | 1330282b691a1 |
13 | 6427b58ba351 |
14 | 2b268ab5d533 |
15 | 149b8b1e8051 |
hex | a4e71cf07c9 |
11332033120201 has 8 divisors (see below), whose sum is σ = 11335024746720. Its totient is φ = 11329041897888.
The previous prime is 11332033120189. The next prime is 11332033120211. The reversal of 11332033120201 is 10202133023311.
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 11332033120201 - 25 = 11332033120169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11332033120211) 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, 60707830 + ... + 60894208.
It is an arithmetic number, because the mean of its divisors is an integer number (1416878093340).
Almost surely, 211332033120201 is an apocalyptic number.
It is an amenable number.
11332033120201 is a deficient number, since it is larger than the sum of its proper divisors (2991626519).
11332033120201 is an equidigital number, since it uses as much as digits as its factorization.
11332033120201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202103.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 11332033120201 its reverse (10202133023311), we get a palindrome (21534166143512).
The spelling of 11332033120201 in words is "eleven trillion, three hundred thirty-two billion, thirty-three million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •