Base | Representation |
---|---|
bin | 11111010100101100010… |
… | …101010101010100010111 |
3 | 21121210000222122211012100 |
4 | 133110230111111110113 |
5 | 240231331213431033 |
6 | 4324504413253143 |
7 | 311341340362125 |
oct | 37245425252427 |
9 | 7553028584170 |
10 | 2152522405143 |
11 | 75a974866290 |
12 | 2a920b4941b3 |
13 | 127c9c589046 |
14 | 7627b244915 |
15 | 3aed3261513 |
hex | 1f52c555517 |
2152522405143 has 12 divisors (see below), whose sum is σ = 3391853487048. Its totient is φ = 1304559033360.
The previous prime is 2152522405129. The next prime is 2152522405151. The reversal of 2152522405143 is 3415042252512.
2152522405143 is a `hidden beast` number, since 2 + 1 + 5 + 2 + 522 + 40 + 51 + 43 = 666.
It is not a de Polignac number, because 2152522405143 - 28 = 2152522404887 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2152522405098 and 2152522405107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2152522405643) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10871325180 + ... + 10871325377.
It is an arithmetic number, because the mean of its divisors is an integer number (282654457254).
Almost surely, 22152522405143 is an apocalyptic number.
2152522405143 is a deficient number, since it is larger than the sum of its proper divisors (1239331081905).
2152522405143 is a wasteful number, since it uses less digits than its factorization.
2152522405143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21742650574 (or 21742650571 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 36.
Adding to 2152522405143 its reverse (3415042252512), we get a palindrome (5567564657655).
The spelling of 2152522405143 in words is "two trillion, one hundred fifty-two billion, five hundred twenty-two million, four hundred five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •