Base | Representation |
---|---|
bin | 11001000000110111101110… |
… | …101000101111101101000100 |
3 | 112102111221121210220001012101 |
4 | 121000313232220233231010 |
5 | 103404410012224323022 |
6 | 1025550204533401444 |
7 | 32113014105543133 |
oct | 3100675650575504 |
9 | 472457553801171 |
10 | 110011001011012 |
11 | 320644490a9632 |
12 | 10408a51799284 |
13 | 494ccba49102a |
14 | 1d247bcdd591a |
15 | cab98a401627 |
hex | 640deea2fb44 |
110011001011012 has 6 divisors (see below), whose sum is σ = 192519251769278. Its totient is φ = 55005500505504.
The previous prime is 110011001011001. The next prime is 110011001011049. The reversal of 110011001011012 is 210110100110011.
It can be written as a sum of positive squares in only one way, i.e., 98901752044096 + 11109248966916 = 9944936^2 + 3333054^2 .
It is a super-2 number, since 2×1100110010110122 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110011001011012.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13751375126373 + ... + 13751375126380.
Almost surely, 2110011001011012 is an apocalyptic number.
It is an amenable number.
110011001011012 is a deficient number, since it is larger than the sum of its proper divisors (82508250758266).
110011001011012 is a wasteful number, since it uses less digits than its factorization.
110011001011012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27502750252757 (or 27502750252755 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 110011001011012 its reverse (210110100110011), we get a palindrome (320121101121023).
The spelling of 110011001011012 in words is "one hundred ten trillion, eleven billion, one million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •