Base | Representation |
---|---|
bin | 101010000000110… |
… | …0111000011000111 |
3 | 10122020121121010222 |
4 | 1110001213003013 |
5 | 10341341130411 |
6 | 351514534555 |
7 | 46635215351 |
oct | 12401470307 |
9 | 3566547128 |
10 | 1409708231 |
11 | 66381a728 |
12 | 33413745b |
13 | 19609a5a9 |
14 | d531c0d1 |
15 | 83b614db |
hex | 540670c7 |
1409708231 has 4 divisors (see below), whose sum is σ = 1432818264. Its totient is φ = 1386598200.
The previous prime is 1409708189. The next prime is 1409708233. The reversal of 1409708231 is 1328079041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1409708231 - 210 = 1409707207 is a prime.
It is a super-2 number, since 2×14097082312 = 3974554593098298722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1409708191 and 1409708200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1409708233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11554925 + ... + 11555046.
It is an arithmetic number, because the mean of its divisors is an integer number (358204566).
Almost surely, 21409708231 is an apocalyptic number.
1409708231 is a deficient number, since it is larger than the sum of its proper divisors (23110033).
1409708231 is an equidigital number, since it uses as much as digits as its factorization.
1409708231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23110032.
The product of its (nonzero) digits is 12096, while the sum is 35.
The square root of 1409708231 is about 37546.0814333533. The cubic root of 1409708231 is about 1121.2688190071.
The spelling of 1409708231 in words is "one billion, four hundred nine million, seven hundred eight thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •