Base | Representation |
---|---|
bin | 101110101011011110… |
… | …1100011011100001011 |
3 | 100120202010022102022021 |
4 | 1131112331203130023 |
5 | 3120244231134311 |
6 | 114015012105311 |
7 | 10146056230225 |
oct | 1352675433413 |
9 | 316663272267 |
10 | 100243224331 |
11 | 39570761148 |
12 | 17517305237 |
13 | 95b701c073 |
14 | 4bcd495415 |
15 | 291a781171 |
hex | 1756f6370b |
100243224331 has 4 divisors (see below), whose sum is σ = 102688181064. Its totient is φ = 97798267600.
The previous prime is 100243224317. The next prime is 100243224371. The reversal of 100243224331 is 133422342001.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 100243224331 - 211 = 100243222283 is a prime.
It is a super-3 number, since 3×1002432243313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100243224296 and 100243224305.
It is not an unprimeable number, because it can be changed into a prime (100243224371) 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, 1222478305 + ... + 1222478386.
It is an arithmetic number, because the mean of its divisors is an integer number (25672045266).
Almost surely, 2100243224331 is an apocalyptic number.
100243224331 is a deficient number, since it is larger than the sum of its proper divisors (2444956733).
100243224331 is an equidigital number, since it uses as much as digits as its factorization.
100243224331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2444956732.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 100243224331 its reverse (133422342001), we get a palindrome (233665566332).
The spelling of 100243224331 in words is "one hundred billion, two hundred forty-three million, two hundred twenty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •