Base | Representation |
---|---|
bin | 101110101000100010… |
… | …1000100010011000111 |
3 | 100120111020121021000001 |
4 | 1131101011010103013 |
5 | 3120043444440011 |
6 | 114001124502131 |
7 | 10143450315415 |
oct | 1352105042307 |
9 | 316436537001 |
10 | 100144530631 |
11 | 3951aa82102 |
12 | 174aa24a947 |
13 | 959c745022 |
14 | 4bc03242b5 |
15 | 2911c887c1 |
hex | 17511444c7 |
100144530631 has 4 divisors (see below), whose sum is σ = 106035385392. Its totient is φ = 94253675872.
The previous prime is 100144530623. The next prime is 100144530641. The reversal of 100144530631 is 136035441001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100144530631 - 23 = 100144530623 is a prime.
It is a super-2 number, since 2×1001445306312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100144530631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100144530641) 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, 2945427355 + ... + 2945427388.
It is an arithmetic number, because the mean of its divisors is an integer number (26508846348).
Almost surely, 2100144530631 is an apocalyptic number.
100144530631 is a deficient number, since it is larger than the sum of its proper divisors (5890854761).
100144530631 is an equidigital number, since it uses as much as digits as its factorization.
100144530631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5890854760.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 100144530631 its reverse (136035441001), we get a palindrome (236179971632).
The spelling of 100144530631 in words is "one hundred billion, one hundred forty-four million, five hundred thirty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •