Base | Representation |
---|---|
bin | 11101011111101011101… |
… | …10111000100101101101 |
3 | 10120212212112010212122000 |
4 | 32233311312320211231 |
5 | 113101012140320140 |
6 | 2053322513442513 |
7 | 133135016613255 |
oct | 16576566704555 |
9 | 3525775125560 |
10 | 1013442120045 |
11 | 360886724713 |
12 | 1444b3870439 |
13 | 7474b138624 |
14 | 3709d7bc965 |
15 | 1b5668eba30 |
hex | ebf5db896d |
1013442120045 has 16 divisors (see below), whose sum is σ = 1801674880320. Its totient is φ = 540502463952.
The previous prime is 1013442120011. The next prime is 1013442120073. The reversal of 1013442120045 is 5400212443101.
1013442120045 is a `hidden beast` number, since 1 + 0 + 1 + 34 + 421 + 200 + 4 + 5 = 666.
It is not a de Polignac number, because 1013442120045 - 215 = 1013442087277 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3753489199 + ... + 3753489468.
It is an arithmetic number, because the mean of its divisors is an integer number (112604680020).
Almost surely, 21013442120045 is an apocalyptic number.
1013442120045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1013442120045 is a deficient number, since it is larger than the sum of its proper divisors (788232760275).
1013442120045 is an equidigital number, since it uses as much as digits as its factorization.
1013442120045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7506978681 (or 7506978675 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 1013442120045 its reverse (5400212443101), we get a palindrome (6413654563146).
The spelling of 1013442120045 in words is "one trillion, thirteen billion, four hundred forty-two million, one hundred twenty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •