Base | Representation |
---|---|
bin | 101010101111011… |
… | …0001111000111111 |
3 | 10200221120110022011 |
4 | 1111132301320333 |
5 | 10414114211111 |
6 | 354150232051 |
7 | 50352630643 |
oct | 12536617077 |
9 | 3627513264 |
10 | 1434132031 |
11 | 676591692 |
12 | 340355627 |
13 | 19b16c447 |
14 | d8678c23 |
15 | 85d88021 |
hex | 557b1e3f |
1434132031 has 8 divisors (see below), whose sum is σ = 1438615424. Its totient is φ = 1429656480.
The previous prime is 1434132023. The next prime is 1434132097. The reversal of 1434132031 is 1302314341.
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 1434132031 - 23 = 1434132023 is a prime.
It is a super-2 number, since 2×14341320312 = 4113469364680369922, 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 = 1434131993 and 1434132011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1434133031) 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, 668146 + ... + 670288.
It is an arithmetic number, because the mean of its divisors is an integer number (179826928).
Almost surely, 21434132031 is an apocalyptic number.
1434132031 is a deficient number, since it is larger than the sum of its proper divisors (4483393).
1434132031 is a wasteful number, since it uses less digits than its factorization.
1434132031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3921.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 1434132031 is about 37869.9357142312. The cubic root of 1434132031 is about 1127.7072657937.
Adding to 1434132031 its reverse (1302314341), we get a palindrome (2736446372).
The spelling of 1434132031 in words is "one billion, four hundred thirty-four million, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •