Base | Representation |
---|---|
bin | 100001011111001011000… |
… | …000000110000011100011 |
3 | 22010222211111211001112202 |
4 | 201133023000012003203 |
5 | 300200341101144021 |
6 | 4521055055243415 |
7 | 325154132223110 |
oct | 41371300060343 |
9 | 8128744731482 |
10 | 2301213303011 |
11 | 807a36a0a647 |
12 | 311ba781956b |
13 | 13900786454c |
14 | 7d544bc5907 |
15 | 3ecd6e53a0b |
hex | 217cb0060e3 |
2301213303011 has 4 divisors (see below), whose sum is σ = 2629958060592. Its totient is φ = 1972468545432.
The previous prime is 2301213302977. The next prime is 2301213303017. The reversal of 2301213303011 is 1103033121032.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2301213303011 - 238 = 2026335396067 is a prime.
It is a super-2 number, since 2×23012133030112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2301213303017) 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 3 ways as a sum of consecutive naturals, for example, 164372378780 + ... + 164372378793.
It is an arithmetic number, because the mean of its divisors is an integer number (657489515148).
Almost surely, 22301213303011 is an apocalyptic number.
2301213303011 is a deficient number, since it is larger than the sum of its proper divisors (328744757581).
2301213303011 is an equidigital number, since it uses as much as digits as its factorization.
2301213303011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328744757580.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 2301213303011 its reverse (1103033121032), we get a palindrome (3404246424043).
The spelling of 2301213303011 in words is "two trillion, three hundred one billion, two hundred thirteen million, three hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •