Base | Representation |
---|---|
bin | 111100010000110… |
… | …101010000011010 |
3 | 2121110110102120000 |
4 | 330100311100122 |
5 | 4032311423102 |
6 | 244154113430 |
7 | 34024513143 |
oct | 7420652032 |
9 | 2543412500 |
10 | 1011045402 |
11 | 479788414 |
12 | 24271b876 |
13 | 131606823 |
14 | 983c4aca |
15 | 5db6401c |
hex | 3c43541a |
1011045402 has 20 divisors (see below), whose sum is σ = 2265490986. Its totient is φ = 337015080.
The previous prime is 1011045353. The next prime is 1011045407. The reversal of 1011045402 is 2045401101.
1011045402 is a `hidden beast` number, since 10 + 110 + 4 + 540 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 849780801 + 161264601 = 29151^2 + 12699^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1011045407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3120349 + ... + 3120672.
Almost surely, 21011045402 is an apocalyptic number.
1011045402 is an abundant number, since it is smaller than the sum of its proper divisors (1254445584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011045402 is an equidigital number, since it uses as much as digits as its factorization.
1011045402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6241035 (or 6241026 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 1011045402 is about 31796.9401358055. The cubic root of 1011045402 is about 1003.6683275850.
Adding to 1011045402 its reverse (2045401101), we get a palindrome (3056446503).
The spelling of 1011045402 in words is "one billion, eleven million, forty-five thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •