Base | Representation |
---|---|
bin | 11011111111011001111010… |
… | …101100011100101011010100 |
3 | 121010212200000001222021010102 |
4 | 123333121322230130223110 |
5 | 112113420313221010400 |
6 | 1113453215152513232 |
7 | 34634000032220120 |
oct | 3377317254345324 |
9 | 533780001867112 |
10 | 123104411110100 |
11 | 36252318823322 |
12 | 1198256224b818 |
13 | 538c9085bc214 |
14 | 22583dcb94580 |
15 | e373654b49d5 |
hex | 6ff67ab1cad4 |
123104411110100 has 72 divisors (see below), whose sum is σ = 309855640261440. Its totient is φ = 41577268043520.
The previous prime is 123104411110069. The next prime is 123104411110127. The reversal of 123104411110100 is 1011114401321.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 1312366865 + ... + 1312460664.
Almost surely, 2123104411110100 is an apocalyptic number.
123104411110100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
123104411110100 is an abundant number, since it is smaller than the sum of its proper divisors (186751229151340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123104411110100 is a wasteful number, since it uses less digits than its factorization.
123104411110100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2624827617 (or 2624827610 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 123104411110100 its reverse (1011114401321), we get a palindrome (124115525511421).
The spelling of 123104411110100 in words is "one hundred twenty-three trillion, one hundred four billion, four hundred eleven million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •