Base | Representation |
---|---|
bin | 100000110100110… |
… | …0110100110101011 |
3 | 2211202112012011000 |
4 | 1001221212212223 |
5 | 4223431100232 |
6 | 301143210043 |
7 | 36202646541 |
oct | 10151464653 |
9 | 2752465130 |
10 | 1101425067 |
11 | 5157a8a56 |
12 | 268a46923 |
13 | 14725c512 |
14 | a63cdd91 |
15 | 66a6827c |
hex | 41a669ab |
1101425067 has 16 divisors (see below), whose sum is σ = 1641758080. Its totient is φ = 729775656.
The previous prime is 1101425057. The next prime is 1101425093. The reversal of 1101425067 is 7605241011.
It is a happy number.
1101425067 is a `hidden beast` number, since 1 + 10 + 142 + 506 + 7 = 666.
It is not a de Polignac number, because 1101425067 - 24 = 1101425051 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1101425067.
It is not an unprimeable number, because it can be changed into a prime (1101425057) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 120733 + ... + 129534.
It is an arithmetic number, because the mean of its divisors is an integer number (102609880).
Almost surely, 21101425067 is an apocalyptic number.
1101425067 is a deficient number, since it is larger than the sum of its proper divisors (540333013).
1101425067 is a wasteful number, since it uses less digits than its factorization.
1101425067 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250439 (or 250433 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
The square root of 1101425067 is about 33187.7246433075. The cubic root of 1101425067 is about 1032.7257013716.
Adding to 1101425067 its reverse (7605241011), we get a palindrome (8706666078).
The spelling of 1101425067 in words is "one billion, one hundred one million, four hundred twenty-five thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •