Base | Representation |
---|---|
bin | 11101011010010001111… |
… | …00110000100010001111 |
3 | 10120121101100112221120022 |
4 | 32231020330300202033 |
5 | 113024042021422201 |
6 | 2052123005012355 |
7 | 133003103326040 |
oct | 16551074604217 |
9 | 3517340487508 |
10 | 1010541201551 |
11 | 35a628188712 |
12 | 143a242540bb |
13 | 743a81357cb |
14 | 36ca64088c7 |
15 | 1b446dca41b |
hex | eb48f3088f |
1010541201551 has 16 divisors (see below), whose sum is σ = 1216384815360. Its totient is φ = 820119945600.
The previous prime is 1010541201497. The next prime is 1010541201557. The reversal of 1010541201551 is 1551021450101.
It is a happy number.
1010541201551 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1010541201551 - 230 = 1009467459727 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1010541201551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010541201557) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1942250 + ... + 2406951.
It is an arithmetic number, because the mean of its divisors is an integer number (76024050960).
Almost surely, 21010541201551 is an apocalyptic number.
1010541201551 is a deficient number, since it is larger than the sum of its proper divisors (205843613809).
1010541201551 is a wasteful number, since it uses less digits than its factorization.
1010541201551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4350974.
The product of its (nonzero) digits is 1000, while the sum is 26.
Adding to 1010541201551 its reverse (1551021450101), we get a palindrome (2561562651652).
The spelling of 1010541201551 in words is "one trillion, ten billion, five hundred forty-one million, two hundred one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •