Base | Representation |
---|---|
bin | 10101001011011100100… |
… | …110110011001001011101 |
3 | 12011010122100001200220121 |
4 | 111023130212303021131 |
5 | 142321124411321131 |
6 | 3032333535114541 |
7 | 210102112525555 |
oct | 25133446631135 |
9 | 5133570050817 |
10 | 1455400104541 |
11 | 511260464859 |
12 | 1b6096672a51 |
13 | a7322382516 |
14 | 506281cc165 |
15 | 27cd1b40911 |
hex | 152dc9b325d |
1455400104541 has 8 divisors (see below), whose sum is σ = 1461466679904. Its totient is φ = 1449335658000.
The previous prime is 1455400104449. The next prime is 1455400104563. The reversal of 1455400104541 is 1454010045541.
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 1455400104541 - 219 = 1455399580253 is a prime.
It is a super-3 number, since 3×14554001045413 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1455400104497 and 1455400104506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1455400104241) 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, 845386 + ... + 1904068.
It is an arithmetic number, because the mean of its divisors is an integer number (182683334988).
Almost surely, 21455400104541 is an apocalyptic number.
It is an amenable number.
1455400104541 is a deficient number, since it is larger than the sum of its proper divisors (6066575363).
1455400104541 is a wasteful number, since it uses less digits than its factorization.
1455400104541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1064411.
The product of its (nonzero) digits is 32000, while the sum is 34.
The spelling of 1455400104541 in words is "one trillion, four hundred fifty-five billion, four hundred million, one hundred four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •