Base | Representation |
---|---|
bin | 1110111101000110… |
… | …0100101110011101 |
3 | 101100202201200201121 |
4 | 3233101210232131 |
5 | 31210134032001 |
6 | 1502201410541 |
7 | 201323336563 |
oct | 35721445635 |
9 | 11322650647 |
10 | 4014361501 |
11 | 1780003237 |
12 | 940499a51 |
13 | 4bc8ac547 |
14 | 2a1211a33 |
15 | 1876606a1 |
hex | ef464b9d |
4014361501 has 2 divisors, whose sum is σ = 4014361502. Its totient is φ = 4014361500.
The previous prime is 4014361493. The next prime is 4014361597. The reversal of 4014361501 is 1051634104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3243188601 + 771172900 = 56949^2 + 27770^2 .
It is a cyclic number.
It is not a de Polignac number, because 4014361501 - 23 = 4014361493 is a prime.
It is a super-2 number, since 2×40143615012 = 32230196521421946002, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4014362501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2007180750 + 2007180751.
It is an arithmetic number, because the mean of its divisors is an integer number (2007180751).
Almost surely, 24014361501 is an apocalyptic number.
It is an amenable number.
4014361501 is a deficient number, since it is larger than the sum of its proper divisors (1).
4014361501 is an equidigital number, since it uses as much as digits as its factorization.
4014361501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 4014361501 is about 63358.9891096757. The cubic root of 4014361501 is about 1589.2985713243.
Adding to 4014361501 its reverse (1051634104), we get a palindrome (5065995605).
The spelling of 4014361501 in words is "four billion, fourteen million, three hundred sixty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •