Base | Representation |
---|---|
bin | 100001110000110011010… |
… | …100010011011011010111 |
3 | 22012210200202221120000212 |
4 | 201300303110103123113 |
5 | 301003123141102221 |
6 | 4533505323000035 |
7 | 326424212441444 |
oct | 41606324233327 |
9 | 8183622846025 |
10 | 2320143300311 |
11 | 814a70452811 |
12 | 3157ab36901b |
13 | 13aa33662195 |
14 | 8041cd3a9cb |
15 | 40543cb1b5b |
hex | 21c335136d7 |
2320143300311 has 4 divisors (see below), whose sum is σ = 2321960171832. Its totient is φ = 2318326428792.
The previous prime is 2320143300257. The next prime is 2320143300347. The reversal of 2320143300311 is 1130033410232.
2320143300311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2320143300311 - 26 = 2320143300247 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2320143000311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 908433845 + ... + 908436398.
It is an arithmetic number, because the mean of its divisors is an integer number (580490042958).
Almost surely, 22320143300311 is an apocalyptic number.
2320143300311 is a deficient number, since it is larger than the sum of its proper divisors (1816871521).
2320143300311 is a wasteful number, since it uses less digits than its factorization.
2320143300311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1816871520.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 2320143300311 its reverse (1130033410232), we get a palindrome (3450176710543).
The spelling of 2320143300311 in words is "two trillion, three hundred twenty billion, one hundred forty-three million, three hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •