Base | Representation |
---|---|
bin | 10110110101010100010110… |
… | …000111100000001011010011 |
3 | 111011120011011020202020100220 |
4 | 112311110112013200023103 |
5 | 101130244202330211311 |
6 | 553324434324044123 |
7 | 30103115013125454 |
oct | 2665242607401323 |
9 | 434504136666326 |
10 | 100421001413331 |
11 | 29aa7342367215 |
12 | b31a31a233643 |
13 | 4405876772481 |
14 | 1ab258c29512b |
15 | b922a9ce4206 |
hex | 5b55161e02d3 |
100421001413331 has 8 divisors (see below), whose sum is σ = 135728842093200. Its totient is φ = 66030247504512.
The previous prime is 100421001413287. The next prime is 100421001413333. The reversal of 100421001413331 is 133314100124001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100421001413331 - 237 = 100283562459859 is a prime.
It is a super-2 number, since 2×1004210014133312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100421001413333) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 229271692506 + ... + 229271692943.
It is an arithmetic number, because the mean of its divisors is an integer number (16966105261650).
Almost surely, 2100421001413331 is an apocalyptic number.
100421001413331 is a deficient number, since it is larger than the sum of its proper divisors (35307840679869).
100421001413331 is an equidigital number, since it uses as much as digits as its factorization.
100421001413331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 458543385525.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 100421001413331 its reverse (133314100124001), we get a palindrome (233735101537332).
The spelling of 100421001413331 in words is "one hundred trillion, four hundred twenty-one billion, one million, four hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •