Base | Representation |
---|---|
bin | 1011000000010100000000… |
… | …1100111100111101000010 |
3 | 1120211202012210201221211101 |
4 | 2300011000030330331002 |
5 | 3041221300000310200 |
6 | 41422355133205014 |
7 | 2356124165042221 |
oct | 260050014747502 |
9 | 46752183657741 |
10 | 12100000010050 |
11 | 3945643617507 |
12 | 143508963076a |
13 | 69a043203a74 |
14 | 2db900a42cb8 |
15 | 15eb3715d26a |
hex | b014033cf42 |
12100000010050 has 12 divisors (see below), whose sum is σ = 22506000018786. Its totient is φ = 4840000004000.
The previous prime is 12100000009969. The next prime is 12100000010051. The reversal of 12100000010050 is 5001000000121.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 9412298794809 + 2687701215241 = 3067947^2 + 1639421^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (12100000010051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 121000000051 + ... + 121000000150.
Almost surely, 212100000010050 is an apocalyptic number.
12100000010050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12100000010050 is a deficient number, since it is larger than the sum of its proper divisors (10406000008736).
12100000010050 is a wasteful number, since it uses less digits than its factorization.
12100000010050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242000000213 (or 242000000208 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 10.
Adding to 12100000010050 its reverse (5001000000121), we get a palindrome (17101000010171).
The spelling of 12100000010050 in words is "twelve trillion, one hundred billion, ten thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •