Base | Representation |
---|---|
bin | 101110110000110111… |
… | …1100101111101111001 |
3 | 100121012201200120100011 |
4 | 1131201233211331321 |
5 | 3121132033122131 |
6 | 114044553141521 |
7 | 10153413612406 |
oct | 1354157457571 |
9 | 317181616304 |
10 | 100424114041 |
11 | 39653881279 |
12 | 175679ba8a1 |
13 | 9615644bb4 |
14 | 4c095012ad |
15 | 292b5b30b1 |
hex | 1761be5f79 |
100424114041 has 4 divisors (see below), whose sum is σ = 100428522084. Its totient is φ = 100419706000.
The previous prime is 100424114039. The next prime is 100424114071. The reversal of 100424114041 is 140411424001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 140411424001 = 977 ⋅143716913.
It can be written as a sum of positive squares in 2 ways, for example, as 95865163641 + 4558950400 = 309621^2 + 67520^2 .
It is a cyclic number.
It is not a de Polignac number, because 100424114041 - 21 = 100424114039 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100424114071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2169670 + ... + 2215471.
It is an arithmetic number, because the mean of its divisors is an integer number (25107130521).
Almost surely, 2100424114041 is an apocalyptic number.
It is an amenable number.
100424114041 is a deficient number, since it is larger than the sum of its proper divisors (4408043).
100424114041 is an equidigital number, since it uses as much as digits as its factorization.
100424114041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4408042.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 100424114041 its reverse (140411424001), we get a palindrome (240835538042).
The spelling of 100424114041 in words is "one hundred billion, four hundred twenty-four million, one hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •