Base | Representation |
---|---|
bin | 10110110101101001111000… |
… | …110101010101001010110010 |
3 | 111011122100212021211122202000 |
4 | 112311221320311111022302 |
5 | 101131134040400234024 |
6 | 553343221502034430 |
7 | 30104564144413365 |
oct | 2665517065251262 |
9 | 434570767748660 |
10 | 100444132430514 |
11 | 2a006132202844 |
12 | b3228b4878a16 |
13 | 4407ac1a150a2 |
14 | 1ab374432a0dc |
15 | b92bb0883cc9 |
hex | 5b5a78d552b2 |
100444132430514 has 64 divisors (see below), whose sum is σ = 231211082102400. Its totient is φ = 32284142944704.
The previous prime is 100444132430461. The next prime is 100444132430519. The reversal of 100444132430514 is 415034231444001.
It is a happy number.
100444132430514 is a `hidden beast` number, since 1 + 0 + 0 + 4 + 4 + 4 + 132 + 4 + 3 + 0 + 514 = 666.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (100444132430519) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41179512 + ... + 43550435.
It is an arithmetic number, because the mean of its divisors is an integer number (3612673157850).
Almost surely, 2100444132430514 is an apocalyptic number.
100444132430514 is an abundant number, since it is smaller than the sum of its proper divisors (130766949671886).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100444132430514 is a wasteful number, since it uses less digits than its factorization.
100444132430514 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84730744 (or 84730738 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 36.
Adding to 100444132430514 its reverse (415034231444001), we get a palindrome (515478363874515).
The spelling of 100444132430514 in words is "one hundred trillion, four hundred forty-four billion, one hundred thirty-two million, four hundred thirty thousand, five hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •