Base | Representation |
---|---|
bin | 1110111101010000… |
… | …1010011001100101 |
3 | 101100211000011120221 |
4 | 3233110022121211 |
5 | 31210322240401 |
6 | 1502224124341 |
7 | 201332164162 |
oct | 35724123145 |
9 | 11324004527 |
10 | 4015040101 |
11 | 1780427066 |
12 | 9407666b1 |
13 | 4bca89397 |
14 | 2a134b069 |
15 | 1877467a1 |
hex | ef50a665 |
4015040101 has 2 divisors, whose sum is σ = 4015040102. Its totient is φ = 4015040100.
The previous prime is 4015040083. The next prime is 4015040123. The reversal of 4015040101 is 1010405104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3495883876 + 519156225 = 59126^2 + 22785^2 .
It is a cyclic number.
It is not a de Polignac number, because 4015040101 - 221 = 4012942949 is a prime.
It is a super-2 number, since 2×40150401012 = 32241094025276180402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4015040171) 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, 2007520050 + 2007520051.
It is an arithmetic number, because the mean of its divisors is an integer number (2007520051).
Almost surely, 24015040101 is an apocalyptic number.
It is an amenable number.
4015040101 is a deficient number, since it is larger than the sum of its proper divisors (1).
4015040101 is an equidigital number, since it uses as much as digits as its factorization.
4015040101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80, while the sum is 16.
The square root of 4015040101 is about 63364.3440824570. The cubic root of 4015040101 is about 1589.3881195829.
Adding to 4015040101 its reverse (1010405104), we get a palindrome (5025445205).
The spelling of 4015040101 in words is "four billion, fifteen million, forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •