Base | Representation |
---|---|
bin | 100000110010100… |
… | …0101011000010001 |
3 | 2211200022000002111 |
4 | 1001211011120101 |
5 | 4223130143101 |
6 | 301101545321 |
7 | 36156613651 |
oct | 10145053021 |
9 | 2750260074 |
10 | 1100240401 |
11 | 515069997 |
12 | 268575241 |
13 | 146c36230 |
14 | a61a2361 |
15 | 668d2251 |
hex | 41945611 |
1100240401 has 8 divisors (see below), whose sum is σ = 1186016384. Its totient is φ = 1014627600.
The previous prime is 1100240377. The next prime is 1100240413. The reversal of 1100240401 is 1040420011.
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-1100240401 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1100240431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26601 + ... + 53926.
It is an arithmetic number, because the mean of its divisors is an integer number (148252048).
Almost surely, 21100240401 is an apocalyptic number.
It is an amenable number.
1100240401 is a deficient number, since it is larger than the sum of its proper divisors (85775983).
1100240401 is a wasteful number, since it uses less digits than its factorization.
1100240401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81591.
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 1100240401 is about 33169.8718870001. The cubic root of 1100240401 is about 1032.3553103339.
Adding to 1100240401 its reverse (1040420011), we get a palindrome (2140660412).
The spelling of 1100240401 in words is "one billion, one hundred million, two hundred forty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •