Base | Representation |
---|---|
bin | 111101101100010… |
… | …111011101110111 |
3 | 2200010121111211012 |
4 | 331230113131313 |
5 | 4104432300011 |
6 | 250412302435 |
7 | 34435462112 |
oct | 7554273567 |
9 | 2603544735 |
10 | 1035040631 |
11 | 491287389 |
12 | 24a771a1b |
13 | 1365885a1 |
14 | 9b66d579 |
15 | 60d03a8b |
hex | 3db17777 |
1035040631 has 8 divisors (see below), whose sum is σ = 1096278624. Its totient is φ = 973841920.
The previous prime is 1035040621. The next prime is 1035040661. The reversal of 1035040631 is 1360405301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1035040631 - 214 = 1035024247 is a prime.
It is a super-2 number, since 2×10350406312 = 2142618215641756322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1035040597 and 1035040606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1035040621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57791 + ... + 73551.
It is an arithmetic number, because the mean of its divisors is an integer number (137034828).
Almost surely, 21035040631 is an apocalyptic number.
1035040631 is a deficient number, since it is larger than the sum of its proper divisors (61237993).
1035040631 is a wasteful number, since it uses less digits than its factorization.
1035040631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19641.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 1035040631 is about 32172.0473548079. The cubic root of 1035040631 is about 1011.5463783634.
Adding to 1035040631 its reverse (1360405301), we get a palindrome (2395445932).
The spelling of 1035040631 in words is "one billion, thirty-five million, forty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •