Base | Representation |
---|---|
bin | 11101011001010010100… |
… | …10011011010111011101 |
3 | 10120120000100000200020221 |
4 | 32230221102123113131 |
5 | 113022000030323401 |
6 | 2051554151441341 |
7 | 132653663304610 |
oct | 16545122332735 |
9 | 3516010020227 |
10 | 1010010011101 |
11 | 35a385358443 |
12 | 1438b6386251 |
13 | 7432207c930 |
14 | 36c55a54177 |
15 | 1b4154507a1 |
hex | eb2949b5dd |
1010010011101 has 8 divisors (see below), whose sum is σ = 1243089244544. Its totient is φ = 799128799920.
The previous prime is 1010010010987. The next prime is 1010010011111. The reversal of 1010010011101 is 1011100100101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1010010011101 - 213 = 1010010002909 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010010011111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5549505465 + ... + 5549505646.
It is an arithmetic number, because the mean of its divisors is an integer number (155386155568).
Almost surely, 21010010011101 is an apocalyptic number.
It is an amenable number.
1010010011101 is a deficient number, since it is larger than the sum of its proper divisors (233079233443).
1010010011101 is a wasteful number, since it uses less digits than its factorization.
1010010011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11099011131.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1010010011101 its reverse (1011100100101), we get a palindrome (2021110111202).
The spelling of 1010010011101 in words is "one trillion, ten billion, ten million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •