Base | Representation |
---|---|
bin | 101010101001110… |
… | …1111110101011111 |
3 | 10200202010112020001 |
4 | 1111103233311133 |
5 | 10412344140111 |
6 | 354004235131 |
7 | 50316224314 |
oct | 12523576537 |
9 | 3622115201 |
10 | 1431240031 |
11 | 674996901 |
12 | 33b39baa7 |
13 | 19a698cc0 |
14 | d8124d0b |
15 | 859b61c1 |
hex | 554efd5f |
1431240031 has 16 divisors (see below), whose sum is σ = 1585947328. Its totient is φ = 1283040000.
The previous prime is 1431240007. The next prime is 1431240053. The reversal of 1431240031 is 1300421341.
It is a 8-Lehmer number, since φ(1431240031) divides (1431240031-1)8.
It is a cyclic number.
It is not a de Polignac number, because 1431240031 - 27 = 1431239903 is a prime.
It is a super-2 number, since 2×14312400312 = 4096896052673761922, 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 = 1431239990 and 1431240008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1431240001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 286606 + ... + 291556.
It is an arithmetic number, because the mean of its divisors is an integer number (99121708).
Almost surely, 21431240031 is an apocalyptic number.
1431240031 is a deficient number, since it is larger than the sum of its proper divisors (154707297).
1431240031 is a wasteful number, since it uses less digits than its factorization.
1431240031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5602.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 1431240031 is about 37831.7331218119. The cubic root of 1431240031 is about 1126.9487293843.
Adding to 1431240031 its reverse (1300421341), we get a palindrome (2731661372).
The spelling of 1431240031 in words is "one billion, four hundred thirty-one million, two hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •