Base | Representation |
---|---|
bin | 100001011111001011000… |
… | …011111001100100000111 |
3 | 22010222211120200201201221 |
4 | 201133023003321210013 |
5 | 300200341330103143 |
6 | 4521055132501211 |
7 | 325154143546033 |
oct | 41371303714407 |
9 | 8128746621657 |
10 | 2301214300423 |
11 | 807a37530a55 |
12 | 311ba801a807 |
13 | 139007b2352c |
14 | 7d544da51c3 |
15 | 3ecd709e2ed |
hex | 217cb0f9907 |
2301214300423 has 4 divisors (see below), whose sum is σ = 2301312847320. Its totient is φ = 2301115753528.
The previous prime is 2301214300369. The next prime is 2301214300487. The reversal of 2301214300423 is 3240034121032.
2301214300423 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 a de Polignac number, because none of the positive numbers 2k-2301214300423 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 (2301214300823) 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, 49238413 + ... + 49285126.
It is an arithmetic number, because the mean of its divisors is an integer number (575328211830).
Almost surely, 22301214300423 is an apocalyptic number.
2301214300423 is a deficient number, since it is larger than the sum of its proper divisors (98546897).
2301214300423 is an equidigital number, since it uses as much as digits as its factorization.
2301214300423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98546896.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 2301214300423 its reverse (3240034121032), we get a palindrome (5541248421455).
The spelling of 2301214300423 in words is "two trillion, three hundred one billion, two hundred fourteen million, three hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •