Base | Representation |
---|---|
bin | 1011000000010100000111… |
… | …1111010110101111111011 |
3 | 1120211202021220011121110211 |
4 | 2300011001333112233323 |
5 | 3041221330140000443 |
6 | 41422402124051551 |
7 | 2356125010666642 |
oct | 260050177265773 |
9 | 46752256147424 |
10 | 12100030000123 |
11 | 394565954049a |
12 | 1435097693bb7 |
13 | 69a0494a4380 |
14 | 2db904a0c359 |
15 | 15eb39ad419d |
hex | b0141fd6bfb |
12100030000123 has 48 divisors (see below), whose sum is σ = 13993258186656. Its totient is φ = 10396713761280.
The previous prime is 12100030000111. The next prime is 12100030000127. The reversal of 12100030000123 is 32100003000121.
It is not a de Polignac number, because 12100030000123 - 229 = 12099493129211 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12100030000127) 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, 271078215 + ... + 271122847.
It is an arithmetic number, because the mean of its divisors is an integer number (291526212222).
Almost surely, 212100030000123 is an apocalyptic number.
12100030000123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
12100030000123 is a deficient number, since it is larger than the sum of its proper divisors (1893228186533).
12100030000123 is a wasteful number, since it uses less digits than its factorization.
12100030000123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45692 (or 45673 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 12100030000123 its reverse (32100003000121), we get a palindrome (44200033000244).
The spelling of 12100030000123 in words is "twelve trillion, one hundred billion, thirty million, one hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •