Base | Representation |
---|---|
bin | 1111101010100… |
… | …11000000100001 |
3 | 100011021102101011 |
4 | 13311103000201 |
5 | 232120141001 |
6 | 21012340521 |
7 | 3153661240 |
oct | 765230041 |
9 | 304242334 |
10 | 131412001 |
11 | 681a6866 |
12 | 38014741 |
13 | 212c13a6 |
14 | 1364a957 |
15 | b80bd51 |
hex | 7d53021 |
131412001 has 4 divisors (see below), whose sum is σ = 150185152. Its totient is φ = 112638852.
The previous prime is 131411981. The next prime is 131412019. The reversal of 131412001 is 100214131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 100214131 = 443 ⋅226217.
It is a cyclic number.
It is not a de Polignac number, because 131412001 - 221 = 129314849 is a prime.
It is a super-2 number, since 2×1314120012 = 34538228013648002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131412031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9386565 + ... + 9386578.
It is an arithmetic number, because the mean of its divisors is an integer number (37546288).
Almost surely, 2131412001 is an apocalyptic number.
It is an amenable number.
131412001 is a deficient number, since it is larger than the sum of its proper divisors (18773151).
131412001 is an equidigital number, since it uses as much as digits as its factorization.
131412001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18773150.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 131412001 is about 11463.5073603152. The cubic root of 131412001 is about 508.4071809820.
Adding to 131412001 its reverse (100214131), we get a palindrome (231626132).
The spelling of 131412001 in words is "one hundred thirty-one million, four hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •