Base | Representation |
---|---|
bin | 10110011011001110000… |
… | …000001100100101101111 |
3 | 12110022201201211021201220 |
4 | 112123032000030211233 |
5 | 200222034414400111 |
6 | 3135541201034423 |
7 | 216223523460465 |
oct | 26331600144557 |
9 | 5408651737656 |
10 | 1541054450031 |
11 | 544615075338 |
12 | 20a800025a13 |
13 | b2422a8baa5 |
14 | 54831cba835 |
15 | 2a14671ae06 |
hex | 166ce00c96f |
1541054450031 has 8 divisors (see below), whose sum is σ = 2162883438720. Its totient is φ = 973297547352.
The previous prime is 1541054449999. The next prime is 1541054450057. The reversal of 1541054450031 is 1300544501451.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1541054450031 - 25 = 1541054449999 is a prime.
It is a super-2 number, since 2×15410544500312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1541054449974 and 1541054450001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1541054450071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13518021435 + ... + 13518021548.
It is an arithmetic number, because the mean of its divisors is an integer number (270360429840).
Almost surely, 21541054450031 is an apocalyptic number.
1541054450031 is a deficient number, since it is larger than the sum of its proper divisors (621828988689).
1541054450031 is a wasteful number, since it uses less digits than its factorization.
1541054450031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27036043005.
The product of its (nonzero) digits is 24000, while the sum is 33.
Adding to 1541054450031 its reverse (1300544501451), we get a palindrome (2841598951482).
The spelling of 1541054450031 in words is "one trillion, five hundred forty-one billion, fifty-four million, four hundred fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •