Base | Representation |
---|---|
bin | 1111101100101100… |
… | …1011000100010011 |
3 | 101212200101220011022 |
4 | 3323023023010103 |
5 | 32112241311011 |
6 | 1534052510055 |
7 | 206266331552 |
oct | 37313130423 |
9 | 11780356138 |
10 | 4214010131 |
11 | 1872776201 |
12 | 99731b32b |
13 | 522072926 |
14 | 2bd941d99 |
15 | 199e4a8db |
hex | fb2cb113 |
4214010131 has 2 divisors, whose sum is σ = 4214010132. Its totient is φ = 4214010130.
The previous prime is 4214010121. The next prime is 4214010137. The reversal of 4214010131 is 1310104124.
It is a happy number.
4214010131 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4214010131 - 226 = 4146901267 is a prime.
It is a super-2 number, since 2×42140101312 = 35515762768341274322, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4214010137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2107005065 + 2107005066.
It is an arithmetic number, because the mean of its divisors is an integer number (2107005066).
Almost surely, 24214010131 is an apocalyptic number.
4214010131 is a deficient number, since it is larger than the sum of its proper divisors (1).
4214010131 is an equidigital number, since it uses as much as digits as its factorization.
4214010131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 4214010131 is about 64915.4075008391. The cubic root of 4214010131 is about 1615.2206507110.
Adding to 4214010131 its reverse (1310104124), we get a palindrome (5524114255).
The spelling of 4214010131 in words is "four billion, two hundred fourteen million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •