Base | Representation |
---|---|
bin | 11110101011011011110… |
… | …11111000010111100101 |
3 | 10201202211211120102121111 |
4 | 33111231323320113211 |
5 | 114232310004321240 |
6 | 2124130241345021 |
7 | 136104602034634 |
oct | 17255573702745 |
9 | 3652754512544 |
10 | 1054111401445 |
11 | 377056450783 |
12 | 150363938171 |
13 | 7852ca6318b |
14 | 3903ac0951b |
15 | 1c6470391ea |
hex | f56def85e5 |
1054111401445 has 8 divisors (see below), whose sum is σ = 1305737994240. Its totient is φ = 816086246160.
The previous prime is 1054111401443. The next prime is 1054111401457. The reversal of 1054111401445 is 5441041114501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1054111401445 - 21 = 1054111401443 is a prime.
It is a super-2 number, since 2×10541114014452 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054111401443) 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, 3400359205 + ... + 3400359514.
It is an arithmetic number, because the mean of its divisors is an integer number (163217249280).
Almost surely, 21054111401445 is an apocalyptic number.
It is an amenable number.
1054111401445 is a deficient number, since it is larger than the sum of its proper divisors (251626592795).
1054111401445 is an equidigital number, since it uses as much as digits as its factorization.
1054111401445 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6800718755.
The product of its (nonzero) digits is 6400, while the sum is 31.
Adding to 1054111401445 its reverse (5441041114501), we get a palindrome (6495152515946).
The spelling of 1054111401445 in words is "one trillion, fifty-four billion, one hundred eleven million, four hundred one thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •