Base | Representation |
---|---|
bin | 11110101011010010101… |
… | …10001010010010010101 |
3 | 10201202122110200120122211 |
4 | 33111221112022102111 |
5 | 114232130301421001 |
6 | 2124114451153421 |
7 | 136102645420021 |
oct | 17255126122225 |
9 | 3652573616584 |
10 | 1054034404501 |
11 | 377016a40841 |
12 | 150341ba5871 |
13 | 78519b14960 |
14 | 390308c5381 |
15 | 1c6403ca351 |
hex | f56958a495 |
1054034404501 has 8 divisors (see below), whose sum is σ = 1140818067200. Its totient is φ = 968065612272.
The previous prime is 1054034404483. The next prime is 1054034404541. The reversal of 1054034404501 is 1054044304501.
1054034404501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1054034404501 - 211 = 1054034402453 is a prime.
It is a super-2 number, since 2×10540344045012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054034404541) 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, 203714925 + ... + 203720098.
It is an arithmetic number, because the mean of its divisors is an integer number (142602258400).
Almost surely, 21054034404501 is an apocalyptic number.
It is an amenable number.
1054034404501 is a deficient number, since it is larger than the sum of its proper divisors (86783662699).
1054034404501 is a wasteful number, since it uses less digits than its factorization.
1054034404501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 407435235.
The product of its (nonzero) digits is 19200, while the sum is 31.
The spelling of 1054034404501 in words is "one trillion, fifty-four billion, thirty-four million, four hundred four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •