Base | Representation |
---|---|
bin | 11110101011110010100… |
… | …10111111111010001101 |
3 | 10201210100010020101210102 |
4 | 33111321102333322031 |
5 | 114233202303323041 |
6 | 2124201211020445 |
7 | 136112405141660 |
oct | 17257122777215 |
9 | 3653303211712 |
10 | 1054302011021 |
11 | 377143aaa556 |
12 | 1503b773a725 |
13 | 785603b01cc |
14 | 390582656d7 |
15 | 1c658b3b09b |
hex | f5794bfe8d |
1054302011021 has 12 divisors (see below), whose sum is σ = 1245038684256. Its totient is φ = 874536224760.
The previous prime is 1054302011003. The next prime is 1054302011053. The reversal of 1054302011021 is 1201102034501.
It is not a de Polignac number, because 1054302011021 - 222 = 1054297816717 is a prime.
It is a super-2 number, since 2×10543020110212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1054302010984 and 1054302011002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054302011221) 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, 78356735 + ... + 78370188.
It is an arithmetic number, because the mean of its divisors is an integer number (103753223688).
Almost surely, 21054302011021 is an apocalyptic number.
It is an amenable number.
1054302011021 is a deficient number, since it is larger than the sum of its proper divisors (190736673235).
1054302011021 is an equidigital number, since it uses as much as digits as its factorization.
1054302011021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156726992 (or 156726961 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 1054302011021 its reverse (1201102034501), we get a palindrome (2255404045522).
The spelling of 1054302011021 in words is "one trillion, fifty-four billion, three hundred two million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •