Base | Representation |
---|---|
bin | 101110110000100001… |
… | …1000011111101110001 |
3 | 100121011220201111011022 |
4 | 1131201003003331301 |
5 | 3121121041043213 |
6 | 114043455025225 |
7 | 10153212442514 |
oct | 1354103037561 |
9 | 317156644138 |
10 | 100412440433 |
11 | 39648228768 |
12 | 17563b0b215 |
13 | 96130b8636 |
14 | 4c07b42d7b |
15 | 292a559308 |
hex | 17610c3f71 |
100412440433 has 4 divisors (see below), whose sum is σ = 102861524388. Its totient is φ = 97963356480.
The previous prime is 100412440423. The next prime is 100412440501. The reversal of 100412440433 is 334044214001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 37848924304 + 62563516129 = 194548^2 + 250127^2 .
It is a cyclic number.
It is not a de Polignac number, because 100412440433 - 216 = 100412374897 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100412440423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1224541916 + ... + 1224541997.
It is an arithmetic number, because the mean of its divisors is an integer number (25715381097).
Almost surely, 2100412440433 is an apocalyptic number.
It is an amenable number.
100412440433 is a deficient number, since it is larger than the sum of its proper divisors (2449083955).
100412440433 is an equidigital number, since it uses as much as digits as its factorization.
100412440433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2449083954.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 100412440433 its reverse (334044214001), we get a palindrome (434456654434).
The spelling of 100412440433 in words is "one hundred billion, four hundred twelve million, four hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •