Base | Representation |
---|---|
bin | 11111010011100100110… |
… | …111111001000110010001 |
3 | 21121122221102201101102212 |
4 | 133103210313321012101 |
5 | 240221402304130131 |
6 | 4324145424521505 |
7 | 311266542034424 |
oct | 37234467710621 |
9 | 7548842641385 |
10 | 2151323505041 |
11 | 75a40a040957 |
12 | 2a8b35a80295 |
13 | 127b3b08b3b9 |
14 | 761a5d1d9bb |
15 | 3ae62d91a2b |
hex | 1f4e4df9191 |
2151323505041 has 48 divisors (see below), whose sum is σ = 2499664261248. Its totient is φ = 1845551769600.
The previous prime is 2151323505029. The next prime is 2151323505049. The reversal of 2151323505041 is 1405053231512.
It is not a de Polignac number, because 2151323505041 - 26 = 2151323504977 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2151323504989 and 2151323505007.
It is not an unprimeable number, because it can be changed into a prime (2151323505049) 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 47 ways as a sum of consecutive naturals, for example, 11626871 + ... + 11810451.
It is an arithmetic number, because the mean of its divisors is an integer number (52076338776).
Almost surely, 22151323505041 is an apocalyptic number.
It is an amenable number.
2151323505041 is a deficient number, since it is larger than the sum of its proper divisors (348340756207).
2151323505041 is a wasteful number, since it uses less digits than its factorization.
2151323505041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183722 (or 183705 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 2151323505041 its reverse (1405053231512), we get a palindrome (3556376736553).
The spelling of 2151323505041 in words is "two trillion, one hundred fifty-one billion, three hundred twenty-three million, five hundred five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •