Base | Representation |
---|---|
bin | 101011110101010110111… |
… | …101011110110011001011 |
3 | 101122222002120010002010201 |
4 | 223311112331132303023 |
5 | 343323022121011021 |
6 | 10223444432553031 |
7 | 430424615212405 |
oct | 53652675366313 |
9 | 11588076102121 |
10 | 3012231032011 |
11 | a615309860a3 |
12 | 40795a0b2777 |
13 | 18b08a7c5656 |
14 | a5b15493b75 |
15 | 5354d3ed591 |
hex | 2bd56f5eccb |
3012231032011 has 8 divisors (see below), whose sum is σ = 3193580801600. Its totient is φ = 2833162391880.
The previous prime is 3012231032009. The next prime is 3012231032017. The reversal of 3012231032011 is 1102301322103.
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 3012231032011 - 21 = 3012231032009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
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 3012231032011.
It is not an unprimeable number, because it can be changed into a prime (3012231032017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 570279645 + ... + 570284926.
It is an arithmetic number, because the mean of its divisors is an integer number (399197600200).
Almost surely, 23012231032011 is an apocalyptic number.
3012231032011 is a deficient number, since it is larger than the sum of its proper divisors (181349769589).
3012231032011 is a wasteful number, since it uses less digits than its factorization.
3012231032011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1140564729.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 3012231032011 its reverse (1102301322103), we get a palindrome (4114532354114).
The spelling of 3012231032011 in words is "three trillion, twelve billion, two hundred thirty-one million, thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •