Base | Representation |
---|---|
bin | 100001100010001… |
… | …0100000110110001 |
3 | 2220102021022021002 |
4 | 1003010110012301 |
5 | 4301023020101 |
6 | 303353011345 |
7 | 36612036206 |
oct | 10304240661 |
9 | 2812238232 |
10 | 1125204401 |
11 | 52816a7a2 |
12 | 2749b3b55 |
13 | 14c166c29 |
14 | a961dcad |
15 | 68bb3d6b |
hex | 431141b1 |
1125204401 has 4 divisors (see below), whose sum is σ = 1126719552. Its totient is φ = 1123689252.
The previous prime is 1125204397. The next prime is 1125204433. The reversal of 1125204401 is 1044025211.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1125204401 - 22 = 1125204397 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1125204001) 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 3 ways as a sum of consecutive naturals, for example, 756461 + ... + 757946.
It is an arithmetic number, because the mean of its divisors is an integer number (281679888).
Almost surely, 21125204401 is an apocalyptic number.
It is an amenable number.
1125204401 is a deficient number, since it is larger than the sum of its proper divisors (1515151).
1125204401 is an equidigital number, since it uses as much as digits as its factorization.
1125204401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1515150.
The product of its (nonzero) digits is 320, while the sum is 20.
The square root of 1125204401 is about 33544.0665543103. The cubic root of 1125204401 is about 1040.1048960395.
Adding to 1125204401 its reverse (1044025211), we get a palindrome (2169229612).
The spelling of 1125204401 in words is "one billion, one hundred twenty-five million, two hundred four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •