Base | Representation |
---|---|
bin | 11110101110011110000… |
… | …01110100111111000001 |
3 | 10201221001100201121111022 |
4 | 33113033001310333001 |
5 | 114244124012203101 |
6 | 2125000031355225 |
7 | 136163141625152 |
oct | 17271701647701 |
9 | 3657040647438 |
10 | 1055740350401 |
11 | 3778119a5190 |
12 | 150739382b15 |
13 | 7872c3936b9 |
14 | 391532b7929 |
15 | 1c6e0055a1b |
hex | f5cf074fc1 |
1055740350401 has 32 divisors (see below), whose sum is σ = 1261741639680. Its totient is φ = 872002252800.
The previous prime is 1055740350361. The next prime is 1055740350433. The reversal of 1055740350401 is 1040530475501.
It is a happy number.
It is not a de Polignac number, because 1055740350401 - 226 = 1055673241537 is a prime.
It is a super-2 number, since 2×10557403504012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1055740350461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37735520 + ... + 37763486.
It is an arithmetic number, because the mean of its divisors is an integer number (39429426240).
Almost surely, 21055740350401 is an apocalyptic number.
1055740350401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1055740350401 is a deficient number, since it is larger than the sum of its proper divisors (206001289279).
1055740350401 is a wasteful number, since it uses less digits than its factorization.
1055740350401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34985.
The product of its (nonzero) digits is 42000, while the sum is 35.
The spelling of 1055740350401 in words is "one trillion, fifty-five billion, seven hundred forty million, three hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •