Base | Representation |
---|---|
bin | 111110000000111… |
… | …011111111101010 |
3 | 2200111202110221101 |
4 | 332000323333222 |
5 | 4112322330010 |
6 | 251124032014 |
7 | 34532351512 |
oct | 7600737752 |
9 | 2614673841 |
10 | 1040433130 |
11 | 49432a8a0 |
12 | 25053260a |
13 | 137725c09 |
14 | 9c274842 |
15 | 6151b73a |
hex | 3e03bfea |
1040433130 has 16 divisors (see below), whose sum is σ = 2043032544. Its totient is φ = 378339280.
The previous prime is 1040433109. The next prime is 1040433139. The reversal of 1040433130 is 313340401.
It is a junction number, because it is equal to n+sod(n) for n = 1040433098 and 1040433107.
It is not an unprimeable number, because it can be changed into a prime (1040433139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4729132 + ... + 4729351.
It is an arithmetic number, because the mean of its divisors is an integer number (127689534).
Almost surely, 21040433130 is an apocalyptic number.
1040433130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1040433130 is a deficient number, since it is larger than the sum of its proper divisors (1002599414).
1040433130 is a wasteful number, since it uses less digits than its factorization.
1040433130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9458501.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 1040433130 is about 32255.7456897217. The cubic root of 1040433130 is about 1013.3000348544.
Adding to 1040433130 its reverse (313340401), we get a palindrome (1353773531).
It can be divided in two parts, 10404 and 33130, that added together give a palindrome (43534).
The spelling of 1040433130 in words is "one billion, forty million, four hundred thirty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •