Base | Representation |
---|---|
bin | 11011111111010110000000… |
… | …010111000111001100111000 |
3 | 121010212021011101010101120010 |
4 | 123333112000113013030320 |
5 | 112113333213032304422 |
6 | 1113451242322301520 |
7 | 34633460663535360 |
oct | 3377260027071470 |
9 | 533767141111503 |
10 | 123100211213112 |
11 | 36250563017581 |
12 | 1198178b7b78a0 |
13 | 538c3b944b383 |
14 | 22581210879a0 |
15 | e371bb905b0c |
hex | 6ff5805c7338 |
123100211213112 has 64 divisors (see below), whose sum is σ = 351735493201920. Its totient is φ = 35169428515968.
The previous prime is 123100211213071. The next prime is 123100211213123. The reversal of 123100211213112 is 211312112001321.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18585048 + ... + 24322919.
It is an arithmetic number, because the mean of its divisors is an integer number (5495867081280).
Almost surely, 2123100211213112 is an apocalyptic number.
123100211213112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
123100211213112 is an abundant number, since it is smaller than the sum of its proper divisors (228635281988808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123100211213112 is a wasteful number, since it uses less digits than its factorization.
123100211213112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42925060 (or 42925056 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 123100211213112 its reverse (211312112001321), we get a palindrome (334412323214433).
The spelling of 123100211213112 in words is "one hundred twenty-three trillion, one hundred billion, two hundred eleven million, two hundred thirteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •