Base | Representation |
---|---|
bin | 1111010001010010… |
… | …0000101001000001 |
3 | 101120200000122121212 |
4 | 3310110200221001 |
5 | 31343322023111 |
6 | 1514424055505 |
7 | 203402033462 |
oct | 36424405101 |
9 | 11520018555 |
10 | 4099017281 |
11 | 1813874397 |
12 | 964904595 |
13 | 5042acb18 |
14 | 2ac56ad69 |
15 | 18ecd398b |
hex | f4520a41 |
4099017281 has 2 divisors, whose sum is σ = 4099017282. Its totient is φ = 4099017280.
The previous prime is 4099017277. The next prime is 4099017283. The reversal of 4099017281 is 1827109904.
4099017281 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 can be written as a sum of positive squares in only one way, i.e., 3616819600 + 482197681 = 60140^2 + 21959^2 .
It is a cyclic number.
It is not a de Polignac number, because 4099017281 - 22 = 4099017277 is a prime.
It is a super-2 number, since 2×40990172812 = 33603885339873265922, which contains 22 as substring.
Together with 4099017283, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (4099017283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2049508640 + 2049508641.
It is an arithmetic number, because the mean of its divisors is an integer number (2049508641).
Almost surely, 24099017281 is an apocalyptic number.
It is an amenable number.
4099017281 is a deficient number, since it is larger than the sum of its proper divisors (1).
4099017281 is an equidigital number, since it uses as much as digits as its factorization.
4099017281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36288, while the sum is 41.
The square root of 4099017281 is about 64023.5681682925. The cubic root of 4099017281 is about 1600.3927787004.
The spelling of 4099017281 in words is "four billion, ninety-nine million, seventeen thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •