Base | Representation |
---|---|
bin | 111101111000111101011… |
… | …100011000010000101011 |
3 | 120001120212021001000022201 |
4 | 331320331130120100223 |
5 | 1024140220402110434 |
6 | 13013453513001031 |
7 | 616162335352132 |
oct | 75707534302053 |
9 | 16046767030281 |
10 | 4253048472619 |
11 | 139a786a93481 |
12 | 5883293b3177 |
13 | 24b0a3610c7b |
14 | 109bc4974919 |
15 | 75971740614 |
hex | 3de3d71842b |
4253048472619 has 2 divisors, whose sum is σ = 4253048472620. Its totient is φ = 4253048472618.
The previous prime is 4253048472601. The next prime is 4253048472667. The reversal of 4253048472619 is 9162748403524.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4253048472619 - 29 = 4253048472107 is a prime.
It is a super-2 number, since 2×42530484726192 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4253048472619.
It is not a weakly prime, because it can be changed into another prime (4253048472689) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2126524236309 + 2126524236310.
It is an arithmetic number, because the mean of its divisors is an integer number (2126524236310).
It is a 1-persistent number, because it is pandigital, but 2⋅4253048472619 = 8506096945238 is not.
Almost surely, 24253048472619 is an apocalyptic number.
4253048472619 is a deficient number, since it is larger than the sum of its proper divisors (1).
4253048472619 is an equidigital number, since it uses as much as digits as its factorization.
4253048472619 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11612160, while the sum is 55.
The spelling of 4253048472619 in words is "four trillion, two hundred fifty-three billion, forty-eight million, four hundred seventy-two thousand, six hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •