Base | Representation |
---|---|
bin | 101011101011000001011… |
… | …101111000110001011011 |
3 | 101121220110010020010222212 |
4 | 223223001131320301123 |
5 | 343132310022310021 |
6 | 10214411303505335 |
7 | 426552605453213 |
oct | 53530135706133 |
9 | 11556403203885 |
10 | 3001133010011 |
11 | a57856387994 |
12 | 40578145824b |
13 | 18a00c49a926 |
14 | a5381589243 |
15 | 530ede4a85b |
hex | 2bac1778c5b |
3001133010011 has 16 divisors (see below), whose sum is σ = 3182022286560. Its totient is φ = 2820729323520.
The previous prime is 3001133009971. The next prime is 3001133010047. The reversal of 3001133010011 is 1100103311003.
It is a happy number.
3001133010011 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3001133010011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3001133010061) 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, 50478260 + ... + 50537678.
It is an arithmetic number, because the mean of its divisors is an integer number (198876392910).
Almost surely, 23001133010011 is an apocalyptic number.
3001133010011 is a deficient number, since it is larger than the sum of its proper divisors (180889276549).
3001133010011 is a wasteful number, since it uses less digits than its factorization.
3001133010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63454.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 3001133010011 its reverse (1100103311003), we get a palindrome (4101236321014).
The spelling of 3001133010011 in words is "three trillion, one billion, one hundred thirty-three million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •