Base | Representation |
---|---|
bin | 11110011010100010101… |
… | …11011010011100011011 |
3 | 10200220102210011110200112 |
4 | 33031101113122130123 |
5 | 114110221242120201 |
6 | 2120030303554535 |
7 | 135334055445122 |
oct | 17152127323433 |
9 | 3626383143615 |
10 | 1045042145051 |
11 | 373222057163 |
12 | 14a6525bba4b |
13 | 77715b44988 |
14 | 3881a526ab9 |
15 | 1c2b5c2c0bb |
hex | f3515da71b |
1045042145051 has 8 divisors (see below), whose sum is σ = 1048772639040. Its totient is φ = 1041315783048.
The previous prime is 1045042145009. The next prime is 1045042145053. The reversal of 1045042145051 is 1505412405401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1045042145051 is a prime.
It is a super-2 number, since 2×10450421450512 (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 = 1045042144999 and 1045042145017.
It is not an unprimeable number, because it can be changed into a prime (1045042145053) 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 7 ways as a sum of consecutive naturals, for example, 525821 + ... + 1538366.
It is an arithmetic number, because the mean of its divisors is an integer number (131096579880).
Almost surely, 21045042145051 is an apocalyptic number.
1045042145051 is a deficient number, since it is larger than the sum of its proper divisors (3730493989).
1045042145051 is a wasteful number, since it uses less digits than its factorization.
1045042145051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2065993.
The product of its (nonzero) digits is 16000, while the sum is 32.
The spelling of 1045042145051 in words is "one trillion, forty-five billion, forty-two million, one hundred forty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •