Base | Representation |
---|---|
bin | 111101111111101… |
… | …011011111101001 |
3 | 2200111010201122012 |
4 | 331333223133221 |
5 | 4112231302101 |
6 | 251113005305 |
7 | 34526506301 |
oct | 7577533751 |
9 | 2614121565 |
10 | 1040103401 |
11 | 494125097 |
12 | 2503b3835 |
13 | 13763bacc |
14 | 9c1ca601 |
15 | 614a3bbb |
hex | 3dfeb7e9 |
1040103401 has 12 divisors (see below), whose sum is σ = 1151259732. Its totient is φ = 936350976.
The previous prime is 1040103359. The next prime is 1040103403. The reversal of 1040103401 is 1043010401.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 516380176 + 523723225 = 22724^2 + 22885^2 .
It is not a de Polignac number, because 1040103401 - 222 = 1035909097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1040103403) 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 11 ways as a sum of consecutive naturals, for example, 48836 + ... + 66821.
It is an arithmetic number, because the mean of its divisors is an integer number (95938311).
Almost surely, 21040103401 is an apocalyptic number.
It is an amenable number.
1040103401 is a deficient number, since it is larger than the sum of its proper divisors (111156331).
1040103401 is a wasteful number, since it uses less digits than its factorization.
1040103401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115720 (or 115697 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 1040103401 is about 32250.6341177968. The cubic root of 1040103401 is about 1013.1929801739.
Adding to 1040103401 its reverse (1043010401), we get a palindrome (2083113802).
The spelling of 1040103401 in words is "one billion, forty million, one hundred three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •