Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …111101001111010110010 |
3 | 10220020220100102221101121 |
4 | 100001121113221322302 |
5 | 121014332304013020 |
6 | 2201444130452454 |
7 | 142355036044234 |
oct | 20013127517262 |
9 | 3806810387347 |
10 | 1101011001010 |
11 | 394a33009018 |
12 | 15947243412a |
13 | 7ca9539781b |
14 | 3b40987a254 |
15 | 1d98e606baa |
hex | 100595e9eb2 |
1101011001010 has 64 divisors (see below), whose sum is σ = 2004621696000. Its totient is φ = 435374367232.
The previous prime is 1101011000951. The next prime is 1101011001019. The reversal of 1101011001010 is 101001101011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1101011000984 and 1101011001002.
It is not an unprimeable number, because it can be changed into a prime (1101011001019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 236825166 + ... + 236829814.
It is an arithmetic number, because the mean of its divisors is an integer number (31322214000).
Almost surely, 21101011001010 is an apocalyptic number.
1101011001010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1101011001010 is a deficient number, since it is larger than the sum of its proper divisors (903610694990).
1101011001010 is a wasteful number, since it uses less digits than its factorization.
1101011001010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5595.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1101011001010 its reverse (101001101011), we get a palindrome (1202012102021).
It can be divided in two parts, 110101 and 1001010, that added together give a palindrome (1111111).
The spelling of 1101011001010 in words is "one trillion, one hundred one billion, eleven million, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •