Base | Representation |
---|---|
bin | 1010000010110110111000… |
… | …1110011111011101010001 |
3 | 1110002211000222222002001100 |
4 | 2200231232032133131101 |
5 | 2421422020303220031 |
6 | 35253350133455013 |
7 | 2216626552602606 |
oct | 240555616373521 |
9 | 43084028862040 |
10 | 11044210210641 |
11 | 3578906818583 |
12 | 12a45377a1469 |
13 | 6216068189ca |
14 | 2a2784d766ad |
15 | 142442adade6 |
hex | a0b6e39f751 |
11044210210641 has 6 divisors (see below), whose sum is σ = 15952748082050. Its totient is φ = 7362806807088.
The previous prime is 11044210210549. The next prime is 11044210210687. The reversal of 11044210210641 is 14601201244011.
It is a happy number.
11044210210641 is a `hidden beast` number, since 1 + 1 + 0 + 4 + 4 + 2 + 1 + 0 + 2 + 10 + 641 = 666.
It can be written as a sum of positive squares in only one way, i.e., 9543131926416 + 1501078284225 = 3089196^2 + 1225185^2 .
It is not a de Polignac number, because 11044210210641 - 29 = 11044210210129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11044210210541) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 613567233916 + ... + 613567233933.
Almost surely, 211044210210641 is an apocalyptic number.
It is an amenable number.
11044210210641 is a deficient number, since it is larger than the sum of its proper divisors (4908537871409).
11044210210641 is a wasteful number, since it uses less digits than its factorization.
11044210210641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1227134467855 (or 1227134467852 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 11044210210641 its reverse (14601201244011), we get a palindrome (25645411454652).
The spelling of 11044210210641 in words is "eleven trillion, forty-four billion, two hundred ten million, two hundred ten thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •