Base | Representation |
---|---|
bin | 1101100111111000101… |
… | …1000001010001100011 |
3 | 211101010000001112001101 |
4 | 3121332023001101203 |
5 | 12313311013131003 |
6 | 255304021415231 |
7 | 22623566055250 |
oct | 3317613012143 |
9 | 741100045041 |
10 | 234045052003 |
11 | 9029236a714 |
12 | 3943926a517 |
13 | 190bb74ab69 |
14 | b48384a427 |
15 | 614c27211d |
hex | 367e2c1463 |
234045052003 has 8 divisors (see below), whose sum is σ = 268974362880. Its totient is φ = 199489317000.
The previous prime is 234045051967. The next prime is 234045052009. The reversal of 234045052003 is 300250540432.
234045052003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-234045052003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (234045052009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93392623 + ... + 93395128.
It is an arithmetic number, because the mean of its divisors is an integer number (33621795360).
Almost surely, 2234045052003 is an apocalyptic number.
234045052003 is a deficient number, since it is larger than the sum of its proper divisors (34929310877).
234045052003 is a wasteful number, since it uses less digits than its factorization.
234045052003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186787937.
The product of its (nonzero) digits is 14400, while the sum is 28.
Adding to 234045052003 its reverse (300250540432), we get a palindrome (534295592435).
The spelling of 234045052003 in words is "two hundred thirty-four billion, forty-five million, fifty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •