Base | Representation |
---|---|
bin | 110000011101011111011… |
… | …100101001110010001101 |
3 | 102210100211102201010020120 |
4 | 300131133130221302031 |
5 | 414030222424013401 |
6 | 11025512340535153 |
7 | 462412325312352 |
oct | 60353734516215 |
9 | 12710742633216 |
10 | 3330201001101 |
11 | 107436a713117 |
12 | 4594b96b14b9 |
13 | 1b206256b760 |
14 | b727b046629 |
15 | 5b95d4d2836 |
hex | 3075f729c8d |
3330201001101 has 16 divisors (see below), whose sum is σ = 4898457009600. Its totient is φ = 1999370206080.
The previous prime is 3330201001097. The next prime is 3330201001121. The reversal of 3330201001101 is 1011001020333.
It is not a de Polignac number, because 3330201001101 - 22 = 3330201001097 is a prime.
It is a super-2 number, since 2×33302010011012 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3330201001121) 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 15 ways as a sum of consecutive naturals, for example, 1041337051 + ... + 1041340248.
It is an arithmetic number, because the mean of its divisors is an integer number (306153563100).
Almost surely, 23330201001101 is an apocalyptic number.
It is an amenable number.
3330201001101 is a deficient number, since it is larger than the sum of its proper divisors (1568256008499).
3330201001101 is a wasteful number, since it uses less digits than its factorization.
3330201001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2082677356.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 3330201001101 its reverse (1011001020333), we get a palindrome (4341202021434).
The spelling of 3330201001101 in words is "three trillion, three hundred thirty billion, two hundred one million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •