Base | Representation |
---|---|
bin | 100001111011000110011… |
… | …010111000111001101011 |
3 | 22020212020102100200012001 |
4 | 201323012122320321223 |
5 | 301143300002241021 |
6 | 4542534500231431 |
7 | 330265224233200 |
oct | 41730632707153 |
9 | 8225212320161 |
10 | 2331201212011 |
11 | 819725345511 |
12 | 31797669b577 |
13 | 13baa65850b9 |
14 | 80b8b7a3ca7 |
15 | 4098e990091 |
hex | 21ec66b8e6b |
2331201212011 has 6 divisors (see below), whose sum is σ = 2711805491580. Its totient is φ = 1998172467396.
The previous prime is 2331201211919. The next prime is 2331201212023. The reversal of 2331201212011 is 1102121021332.
It is not a de Polignac number, because 2331201212011 - 221 = 2331199114859 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2331201212011.
It is not an unprimeable number, because it can be changed into a prime (2331201212311) 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 5 ways as a sum of consecutive naturals, for example, 23787767421 + ... + 23787767518.
It is an arithmetic number, because the mean of its divisors is an integer number (451967581930).
Almost surely, 22331201212011 is an apocalyptic number.
2331201212011 is a deficient number, since it is larger than the sum of its proper divisors (380604279569).
2331201212011 is an equidigital number, since it uses as much as digits as its factorization.
2331201212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47575534953 (or 47575534946 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 2331201212011 its reverse (1102121021332), we get a palindrome (3433322233343).
The spelling of 2331201212011 in words is "two trillion, three hundred thirty-one billion, two hundred one million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •