Base | Representation |
---|---|
bin | 100001011110011011111… |
… | …010001101111110011001 |
3 | 22010220210110011100211112 |
4 | 201132123322031332121 |
5 | 300142231321432213 |
6 | 4520444433310105 |
7 | 325125426566213 |
oct | 41363372157631 |
9 | 8126713140745 |
10 | 2300423233433 |
11 | 807670a41686 |
12 | 311a07105335 |
13 | 138c0cc7a660 |
14 | 7d4abcc35b3 |
15 | 3ec8c8ddea8 |
hex | 2179be8df99 |
2300423233433 has 8 divisors (see below), whose sum is σ = 2534992329408. Its totient is φ = 2074084632144.
The previous prime is 2300423233417. The next prime is 2300423233439. The reversal of 2300423233433 is 3343323240032.
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 2300423233433 - 24 = 2300423233417 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 2300423233433.
It is not an unprimeable number, because it can be changed into a prime (2300423233439) 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, 2057623085 + ... + 2057624202.
It is an arithmetic number, because the mean of its divisors is an integer number (316874041176).
Almost surely, 22300423233433 is an apocalyptic number.
It is an amenable number.
2300423233433 is a deficient number, since it is larger than the sum of its proper divisors (234569095975).
2300423233433 is a wasteful number, since it uses less digits than its factorization.
2300423233433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4115247343.
The product of its (nonzero) digits is 93312, while the sum is 32.
Adding to 2300423233433 its reverse (3343323240032), we get a palindrome (5643746473465).
The spelling of 2300423233433 in words is "two trillion, three hundred billion, four hundred twenty-three million, two hundred thirty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •