Base | Representation |
---|---|
bin | 10011001101000101011001… |
… | …00010100101000101110011 |
3 | 12112112020121220212100121000 |
4 | 21212202230202211011303 |
5 | 21013403103334401433 |
6 | 225452354251533043 |
7 | 11616042606254160 |
oct | 1146425442450563 |
9 | 175466556770530 |
10 | 42231013200243 |
11 | 12502087a9a45a |
12 | 48a07a0a5a183 |
13 | 1a744a13c265a |
14 | a5ddc5c7b067 |
15 | 4d37d3bd5113 |
hex | 2668ac8a5173 |
42231013200243 has 32 divisors (see below), whose sum is σ = 71502976248320. Its totient is φ = 24131760602400.
The previous prime is 42231013200197. The next prime is 42231013200317. The reversal of 42231013200243 is 34200231013224.
42231013200243 is a `hidden beast` number, since 4 + 2 + 2 + 310 + 1 + 320 + 0 + 24 + 3 = 666.
It is not a de Polignac number, because 42231013200243 - 213 = 42231013192051 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42231013200743) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18242796 + ... + 20426982.
It is an arithmetic number, because the mean of its divisors is an integer number (2234468007760).
Almost surely, 242231013200243 is an apocalyptic number.
42231013200243 is a deficient number, since it is larger than the sum of its proper divisors (29271963048077).
42231013200243 is a wasteful number, since it uses less digits than its factorization.
42231013200243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2286504 (or 2286498 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 42231013200243 its reverse (34200231013224), we get a palindrome (76431244213467).
The spelling of 42231013200243 in words is "forty-two trillion, two hundred thirty-one billion, thirteen million, two hundred thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •