Base | Representation |
---|---|
bin | 110100011000110011100010… |
… | …110101010001000110110110 |
3 | 1010012210022111101201012011210 |
4 | 310120303202311101012312 |
5 | 220144410401444204032 |
6 | 2134005405154542250 |
7 | 66350032621025544 |
oct | 6430634265210666 |
9 | 1105708441635153 |
10 | 230403031241142 |
11 | 674604165a5071 |
12 | 21a11798b97986 |
13 | 9b73bb303b876 |
14 | 40c77cd98cd94 |
15 | 1b984a19272cc |
hex | d18ce2d511b6 |
230403031241142 has 8 divisors (see below), whose sum is σ = 460806062482296. Its totient is φ = 76801010413712.
The previous prime is 230403031241081. The next prime is 230403031241161. The reversal of 230403031241142 is 241142130304032.
It is a sphenic number, since it is the product of 3 distinct primes.
230403031241142 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19200252603423 + ... + 19200252603434.
It is an arithmetic number, because the mean of its divisors is an integer number (57600757810287).
Almost surely, 2230403031241142 is an apocalyptic number.
230403031241142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230403031241142 is a wasteful number, since it uses less digits than its factorization.
230403031241142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38400505206862.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 230403031241142 its reverse (241142130304032), we get a palindrome (471545161545174).
The spelling of 230403031241142 in words is "two hundred thirty trillion, four hundred three billion, thirty-one million, two hundred forty-one thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •