Base | Representation |
---|---|
bin | 1001000100010110… |
… | …1111000111010111 |
3 | 20021122101011200102 |
4 | 2101011233013113 |
5 | 14441123400043 |
6 | 1041313204315 |
7 | 114215234033 |
oct | 22105570727 |
9 | 6248334612 |
10 | 2434200023 |
11 | 103a051562 |
12 | 57b26069b |
13 | 2ca401558 |
14 | 1914031c3 |
15 | e3a7e6b8 |
hex | 9116f1d7 |
2434200023 has 8 divisors (see below), whose sum is σ = 2447503536. Its totient is φ = 2420913600.
The previous prime is 2434200019. The next prime is 2434200047. The reversal of 2434200023 is 3200024342.
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 2434200023 - 22 = 2434200019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2434199968 and 2434200004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2434200823) 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 7 ways as a sum of consecutive naturals, for example, 366593 + ... + 373173.
It is an arithmetic number, because the mean of its divisors is an integer number (305937942).
Almost surely, 22434200023 is an apocalyptic number.
2434200023 is a deficient number, since it is larger than the sum of its proper divisors (13303513).
2434200023 is a wasteful number, since it uses less digits than its factorization.
2434200023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8545.
The product of its (nonzero) digits is 1152, while the sum is 20.
The square root of 2434200023 is about 49337.6126601197. The cubic root of 2434200023 is about 1345.1955461645.
Adding to 2434200023 its reverse (3200024342), we get a palindrome (5634224365).
The spelling of 2434200023 in words is "two billion, four hundred thirty-four million, two hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •