Base | Representation |
---|---|
bin | 1011000000010100011111… |
… | …1101010010010100111111 |
3 | 1120211202112212120021112022 |
4 | 2300011013331102110333 |
5 | 3041222031302333043 |
6 | 41422420102030355 |
7 | 2356130335004420 |
oct | 260050775222477 |
9 | 46752485507468 |
10 | 12100130121023 |
11 | 394570000483a |
12 | 14351051183bb |
13 | 69a06415abc9 |
14 | 2db914031647 |
15 | 15eb437ae868 |
hex | b0147f5253f |
12100130121023 has 16 divisors (see below), whose sum is σ = 14166667260480. Its totient is φ = 10118103379200.
The previous prime is 12100130120993. The next prime is 12100130121059. The reversal of 12100130121023 is 32012103100121.
It is a cyclic number.
It is not a de Polignac number, because 12100130121023 - 212 = 12100130116927 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12100130120992 and 12100130121010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12100130121223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5243513 + ... + 7189901.
It is an arithmetic number, because the mean of its divisors is an integer number (885416703780).
Almost surely, 212100130121023 is an apocalyptic number.
12100130121023 is a deficient number, since it is larger than the sum of its proper divisors (2066537139457).
12100130121023 is a wasteful number, since it uses less digits than its factorization.
12100130121023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1968098.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 12100130121023 its reverse (32012103100121), we get a palindrome (44112233221144).
The spelling of 12100130121023 in words is "twelve trillion, one hundred billion, one hundred thirty million, one hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •