Base | Representation |
---|---|
bin | 1010001000100000… |
… | …01100101100101011 |
3 | 112001010102220021221 |
4 | 11010100030230223 |
5 | 42120124024144 |
6 | 2255451242511 |
7 | 251544532525 |
oct | 50420145453 |
9 | 15033386257 |
10 | 5440064299 |
11 | 234185790a |
12 | 1079a49437 |
13 | 68908a077 |
14 | 3986d4a15 |
15 | 21c8d0d84 |
hex | 14440cb2b |
5440064299 has 2 divisors, whose sum is σ = 5440064300. Its totient is φ = 5440064298.
The previous prime is 5440064257. The next prime is 5440064341. The reversal of 5440064299 is 9924600445.
5440064299 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (5440064257) and next prime (5440064341).
It is a cyclic number.
It is not a de Polignac number, because 5440064299 - 221 = 5437967147 is a prime.
It is a super-2 number, since 2×54400642992 = 59188599154508722802, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5440064099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2720032149 + 2720032150.
It is an arithmetic number, because the mean of its divisors is an integer number (2720032150).
Almost surely, 25440064299 is an apocalyptic number.
5440064299 is a deficient number, since it is larger than the sum of its proper divisors (1).
5440064299 is an equidigital number, since it uses as much as digits as its factorization.
5440064299 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 311040, while the sum is 43.
The square root of 5440064299 is about 73756.7915449147. The cubic root of 5440064299 is about 1758.7387980456.
The spelling of 5440064299 in words is "five billion, four hundred forty million, sixty-four thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •