Base | Representation |
---|---|
bin | 10110110000111111000000… |
… | …111101111111011110101100 |
3 | 111010111200112100200211211121 |
4 | 112300333000331333132230 |
5 | 101110404323322111244 |
6 | 552535550005230324 |
7 | 30042443505625162 |
oct | 2660770075773654 |
9 | 433450470624747 |
10 | 100123220113324 |
11 | 299a2023602081 |
12 | b290673a023a4 |
13 | 43b376b4c19c5 |
14 | 1aa1dbda9b232 |
15 | b8967c2e7c84 |
hex | 5b0fc0f7f7ac |
100123220113324 has 12 divisors (see below), whose sum is σ = 182833706294064. Its totient is φ = 47885018315024.
The previous prime is 100123220113307. The next prime is 100123220113327. The reversal of 100123220113324 is 423311022321001.
It is a super-2 number, since 2×1001232201133242 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100123220113327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 544147935307 + ... + 544147935490.
It is an arithmetic number, because the mean of its divisors is an integer number (15236142191172).
Almost surely, 2100123220113324 is an apocalyptic number.
It is an amenable number.
100123220113324 is a deficient number, since it is larger than the sum of its proper divisors (82710486180740).
100123220113324 is a wasteful number, since it uses less digits than its factorization.
100123220113324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1088295870824 (or 1088295870822 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 100123220113324 its reverse (423311022321001), we get a palindrome (523434242434325).
The spelling of 100123220113324 in words is "one hundred trillion, one hundred twenty-three billion, two hundred twenty million, one hundred thirteen thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •