Base | Representation |
---|---|
bin | 1111000011101100001000… |
… | …10010000100001010001001 |
3 | 11100020111011201200121020211 |
4 | 13201312010102010022021 |
5 | 13320002111241304001 |
6 | 154231255434521121 |
7 | 6655162153624546 |
oct | 741660422041211 |
9 | 140214151617224 |
10 | 33112122213001 |
11 | a606854837987 |
12 | 38694268961a1 |
13 | 15625c9033690 |
14 | 8268c7255bcd |
15 | 3c64c7ab9351 |
hex | 1e1d84484289 |
33112122213001 has 16 divisors (see below), whose sum is σ = 36630282111808. Its totient is φ = 29733016939200.
The previous prime is 33112122212993. The next prime is 33112122213017. The reversal of 33112122213001 is 10031222121133.
It is a cyclic number.
It is not a de Polignac number, because 33112122213001 - 23 = 33112122212993 is a prime.
It is a super-2 number, since 2×331121222130012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (33112122213101) 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, 4458615 + ... + 9279196.
It is an arithmetic number, because the mean of its divisors is an integer number (2289392631988).
Almost surely, 233112122213001 is an apocalyptic number.
It is an amenable number.
33112122213001 is a deficient number, since it is larger than the sum of its proper divisors (3518159898807).
33112122213001 is a wasteful number, since it uses less digits than its factorization.
33112122213001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13742872.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 33112122213001 its reverse (10031222121133), we get a palindrome (43143344334134).
The spelling of 33112122213001 in words is "thirty-three trillion, one hundred twelve billion, one hundred twenty-two million, two hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •