Base | Representation |
---|---|
bin | 11011111110000100110010… |
… | …110101100010111001010101 |
3 | 121010112221002020221212200102 |
4 | 123332010302311202321111 |
5 | 112110421121333101401 |
6 | 1113343221444023445 |
7 | 34624253044045340 |
oct | 3376046265427125 |
9 | 533487066855612 |
10 | 123013011222101 |
11 | 3621758598a700 |
12 | 119688b4691b85 |
13 | 538410075a460 |
14 | 2253c0bdb3457 |
15 | e34cb62b656b |
hex | 6fe132d62e55 |
123013011222101 has 48 divisors (see below), whose sum is σ = 176204718934272. Its totient is φ = 83276128995840.
The previous prime is 123013011222019. The next prime is 123013011222247. The reversal of 123013011222101 is 101222110310321.
It is not a de Polignac number, because 123013011222101 - 230 = 123011937480277 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123013011222401) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 328396025 + ... + 328770398.
It is an arithmetic number, because the mean of its divisors is an integer number (3670931644464).
Almost surely, 2123013011222101 is an apocalyptic number.
123013011222101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
123013011222101 is a deficient number, since it is larger than the sum of its proper divisors (53191707712171).
123013011222101 is a wasteful number, since it uses less digits than its factorization.
123013011222101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 657166482 (or 657166471 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 123013011222101 its reverse (101222110310321), we get a palindrome (224235121532422).
The spelling of 123013011222101 in words is "one hundred twenty-three trillion, thirteen billion, eleven million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •