Base | Representation |
---|---|
bin | 11100000010011010101100… |
… | …010101001110010110001100 |
3 | 121011121110021122102212012021 |
4 | 130002122230111032112030 |
5 | 112130313222443004400 |
6 | 1114132250504415524 |
7 | 34654645334344141 |
oct | 3402325425162614 |
9 | 534543248385167 |
10 | 123311402313100 |
11 | 3632208797a841 |
12 | 119b66ab1775a4 |
13 | 53a62a51541b1 |
14 | 22644375823c8 |
15 | e3c92c5b671a |
hex | 7026ac54e58c |
123311402313100 has 36 divisors (see below), whose sum is σ = 267615854742544. Its totient is φ = 49319010377280.
The previous prime is 123311402313041. The next prime is 123311402313137. The reversal of 123311402313100 is 1313204113321.
It is a super-2 number, since 2×1233114023131002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 68488707 + ... + 70266106.
Almost surely, 2123311402313100 is an apocalyptic number.
123311402313100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
123311402313100 is an abundant number, since it is smaller than the sum of its proper divisors (144304452429444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123311402313100 is a wasteful number, since it uses less digits than its factorization.
123311402313100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138763714 (or 138763707 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 123311402313100 its reverse (1313204113321), we get a palindrome (124624606426421).
The spelling of 123311402313100 in words is "one hundred twenty-three trillion, three hundred eleven billion, four hundred two million, three hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •