Base | Representation |
---|---|
bin | 1010000000111110111001… |
… | …1010100100001011110100 |
3 | 1102222201220021212210101211 |
4 | 2200033232122210023310 |
5 | 2420410034241333022 |
6 | 35230502105131204 |
7 | 2214406440056323 |
oct | 240175632441364 |
9 | 42881807783354 |
10 | 11012001121012 |
11 | 3566188606841 |
12 | 129a248a89b04 |
13 | 61b57288bba8 |
14 | 2a0dab3a60ba |
15 | 1416aa09be77 |
hex | a03ee6a42f4 |
11012001121012 has 12 divisors (see below), whose sum is σ = 19275833025540. Its totient is φ = 5504620256576.
The previous prime is 11012001120979. The next prime is 11012001121013. The reversal of 11012001121012 is 21012110021011.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 9195474019216 + 1816527101796 = 3032404^2 + 1347786^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11012001120983 and 11012001121001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012001121013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 345058033 + ... + 345089944.
It is an arithmetic number, because the mean of its divisors is an integer number (1606319418795).
Almost surely, 211012001121012 is an apocalyptic number.
It is an amenable number.
11012001121012 is a deficient number, since it is larger than the sum of its proper divisors (8263831904528).
11012001121012 is a wasteful number, since it uses less digits than its factorization.
11012001121012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690151970 (or 690151968 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11012001121012 its reverse (21012110021011), we get a palindrome (32024111142023).
The spelling of 11012001121012 in words is "eleven trillion, twelve billion, one million, one hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •