Base | Representation |
---|---|
bin | 10110110101011100111011… |
… | …110110011011001000110001 |
3 | 111011121000222000102202111110 |
4 | 112311130323312123020301 |
5 | 101130422044421430131 |
6 | 553333001432503533 |
7 | 30103562404223226 |
oct | 2665347366331061 |
9 | 434530860382443 |
10 | 100430224405041 |
11 | 2a000245514413 |
12 | b320072b4aba9 |
13 | 44066b6499b0b |
14 | 1ab2bc515594d |
15 | b9264986c646 |
hex | 5b573bd9b231 |
100430224405041 has 4 divisors (see below), whose sum is σ = 133906965873392. Its totient is φ = 66953482936692.
The previous prime is 100430224405039. The next prime is 100430224405073. The reversal of 100430224405041 is 140504422034001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 100430224405041 - 21 = 100430224405039 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100430224405001) 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, 16738370734171 + ... + 16738370734176.
It is an arithmetic number, because the mean of its divisors is an integer number (33476741468348).
Almost surely, 2100430224405041 is an apocalyptic number.
It is an amenable number.
100430224405041 is a deficient number, since it is larger than the sum of its proper divisors (33476741468351).
100430224405041 is an equidigital number, since it uses as much as digits as its factorization.
100430224405041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33476741468350.
The product of its (nonzero) digits is 15360, while the sum is 30.
Adding to 100430224405041 its reverse (140504422034001), we get a palindrome (240934646439042).
The spelling of 100430224405041 in words is "one hundred trillion, four hundred thirty billion, two hundred twenty-four million, four hundred five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •