Base | Representation |
---|---|
bin | 1111010001010100… |
… | …0000111000101111 |
3 | 101120200021100210122 |
4 | 3310111000320233 |
5 | 31343340234414 |
6 | 1514430555155 |
7 | 203403123524 |
oct | 36425007057 |
9 | 11520240718 |
10 | 4099149359 |
11 | 1813954648 |
12 | 964968abb |
13 | 504327c86 |
14 | 2ac5a314b |
15 | 18ed0cb8e |
hex | f4540e2f |
4099149359 has 2 divisors, whose sum is σ = 4099149360. Its totient is φ = 4099149358.
The previous prime is 4099149323. The next prime is 4099149407. The reversal of 4099149359 is 9539419904.
It is a happy number.
4099149359 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4099149359 - 212 = 4099145263 is a prime.
It is a super-3 number, since 3×40991493593 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 4099149359.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4099149959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2049574679 + 2049574680.
It is an arithmetic number, because the mean of its divisors is an integer number (2049574680).
Almost surely, 24099149359 is an apocalyptic number.
4099149359 is a deficient number, since it is larger than the sum of its proper divisors (1).
4099149359 is an equidigital number, since it uses as much as digits as its factorization.
4099149359 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1574640, while the sum is 53.
The square root of 4099149359 is about 64024.5996395136. The cubic root of 4099149359 is about 1600.4099677315.
The spelling of 4099149359 in words is "four billion, ninety-nine million, one hundred forty-nine thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •