Base | Representation |
---|---|
bin | 111101100011100101110… |
… | …010010111001110001001 |
3 | 112222101122011002102210011 |
4 | 331203211302113032021 |
5 | 1023301222332112131 |
6 | 12555141003551521 |
7 | 614420616162235 |
oct | 75434562271611 |
9 | 15871564072704 |
10 | 4230103004041 |
11 | 1390a8195a302 |
12 | 5839a4b2b5a1 |
13 | 248b87935925 |
14 | 108a493dd5c5 |
15 | 7507c1030b1 |
hex | 3d8e5c97389 |
4230103004041 has 32 divisors (see below), whose sum is σ = 4767677107200. Its totient is φ = 3733411153920.
The previous prime is 4230103004027. The next prime is 4230103004117. The reversal of 4230103004041 is 1404003010324.
It is a cyclic number.
It is not a de Polignac number, because 4230103004041 - 217 = 4230102872969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4230103004021) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 4038270 + ... + 4976728.
It is an arithmetic number, because the mean of its divisors is an integer number (148989909600).
Almost surely, 24230103004041 is an apocalyptic number.
4230103004041 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
4230103004041 is a deficient number, since it is larger than the sum of its proper divisors (537574103159).
4230103004041 is a wasteful number, since it uses less digits than its factorization.
4230103004041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 938769.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 4230103004041 its reverse (1404003010324), we get a palindrome (5634106014365).
The spelling of 4230103004041 in words is "four trillion, two hundred thirty billion, one hundred three million, four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •