Base | Representation |
---|---|
bin | 10110101111101001100110… |
… | …110100000011001001010001 |
3 | 111010011220211011001012111211 |
4 | 112233221212310003021101 |
5 | 101102404014342303431 |
6 | 552425502012540121 |
7 | 30033016102250005 |
oct | 2657514664031121 |
9 | 433156734035454 |
10 | 100031513244241 |
11 | 29967143456a87 |
12 | b27693b481641 |
13 | 43a7c14b89727 |
14 | 1a9b7a020a705 |
15 | b870b11ac2b1 |
hex | 5afa66d03251 |
100031513244241 has 32 divisors (see below), whose sum is σ = 106463996979200. Its totient is φ = 93721193415360.
The previous prime is 100031513244217. The next prime is 100031513244281. The reversal of 100031513244241 is 142442315130001.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 100031513244241 - 215 = 100031513211473 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100031513244211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6300395995 + ... + 6300411871.
It is an arithmetic number, because the mean of its divisors is an integer number (3326999905600).
Almost surely, 2100031513244241 is an apocalyptic number.
It is an amenable number.
100031513244241 is a deficient number, since it is larger than the sum of its proper divisors (6432483734959).
100031513244241 is a wasteful number, since it uses less digits than its factorization.
100031513244241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25109.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 100031513244241 its reverse (142442315130001), we get a palindrome (242473828374242).
The spelling of 100031513244241 in words is "one hundred trillion, thirty-one billion, five hundred thirteen million, two hundred forty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •