Base | Representation |
---|---|
bin | 10110110101101001110111… |
… | …000110101101100011100101 |
3 | 111011122100210021021101211120 |
4 | 112311221313012231203211 |
5 | 101131134010434314141 |
6 | 553343214544324153 |
7 | 30104563343060010 |
oct | 2665516706554345 |
9 | 434570707241746 |
10 | 100444103432421 |
11 | 2a0061178a7081 |
12 | b3228a7013659 |
13 | 4407ab8a01158 |
14 | 1ab374053c377 |
15 | b92bad056c66 |
hex | 5b5a771ad8e5 |
100444103432421 has 16 divisors (see below), whose sum is σ = 153058149193344. Its totient is φ = 57396455118144.
The previous prime is 100444103432377. The next prime is 100444103432429. The reversal of 100444103432421 is 124234301444001.
It is a happy number.
It is not a de Polignac number, because 100444103432421 - 29 = 100444103431909 is a prime.
It is a super-2 number, since 2×1004441034324212 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100444103432429) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 109090 + ... + 14173923.
It is an arithmetic number, because the mean of its divisors is an integer number (9566134324584).
Almost surely, 2100444103432421 is an apocalyptic number.
It is an amenable number.
100444103432421 is a deficient number, since it is larger than the sum of its proper divisors (52614045760923).
100444103432421 is a wasteful number, since it uses less digits than its factorization.
100444103432421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14617900.
The product of its (nonzero) digits is 36864, while the sum is 33.
Adding to 100444103432421 its reverse (124234301444001), we get a palindrome (224678404876422).
The spelling of 100444103432421 in words is "one hundred trillion, four hundred forty-four billion, one hundred three million, four hundred thirty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •