Base | Representation |
---|---|
bin | 101101101110011001111010… |
… | …010001000000001110000010 |
3 | 222101001001212011012200221100 |
4 | 231232121322101000032002 |
5 | 202324314332030323020 |
6 | 1551412310103035230 |
7 | 60234032333066544 |
oct | 5556317221001602 |
9 | 871031764180840 |
10 | 201101010011010 |
11 | 5909350650558a |
12 | 1a67a88143bb16 |
13 | 882998939abb5 |
14 | 37934ab2c3694 |
15 | 183b17354ca90 |
hex | b6e67a440382 |
201101010011010 has 96 divisors (see below), whose sum is σ = 565256893181760. Its totient is φ = 49431372004224.
The previous prime is 201101010010883. The next prime is 201101010011017. The reversal of 201101010011010 is 10110010101102.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201101010010983 and 201101010011001.
It is not an unprimeable number, because it can be changed into a prime (201101010011017) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1589165512 + ... + 1589292051.
It is an arithmetic number, because the mean of its divisors is an integer number (5888092637310).
Almost surely, 2201101010011010 is an apocalyptic number.
201101010011010 is an abundant number, since it is smaller than the sum of its proper divisors (364155883170750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201101010011010 is a wasteful number, since it uses less digits than its factorization.
201101010011010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3178457632 (or 3178457629 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 201101010011010 its reverse (10110010101102), we get a palindrome (211211020112112).
The spelling of 201101010011010 in words is "two hundred one trillion, one hundred one billion, ten million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •