Base | Representation |
---|---|
bin | 1111110110000100… |
… | …0111000001000111 |
3 | 101222102100210111111 |
4 | 3331201013001013 |
5 | 32202322041033 |
6 | 1542015145451 |
7 | 210254403460 |
oct | 37541070107 |
9 | 11872323444 |
10 | 4253315143 |
11 | 1892981690 |
12 | 9a8515287 |
13 | 52a25502c |
14 | 2c4c53d67 |
15 | 19d6117cd |
hex | fd847047 |
4253315143 has 16 divisors (see below), whose sum is σ = 5375483136. Its totient is φ = 3268866240.
The previous prime is 4253315093. The next prime is 4253315159. The reversal of 4253315143 is 3415133524.
4253315143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4253315143 is a prime.
It is a super-2 number, since 2×42533151432 = 36181379411346220898, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4253315743) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 372721 + ... + 383962.
It is an arithmetic number, because the mean of its divisors is an integer number (335967696).
Almost surely, 24253315143 is an apocalyptic number.
4253315143 is a deficient number, since it is larger than the sum of its proper divisors (1122167993).
4253315143 is a wasteful number, since it uses less digits than its factorization.
4253315143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 756774.
The product of its digits is 21600, while the sum is 31.
The square root of 4253315143 is about 65217.4450818184. The cubic root of 4253315143 is about 1620.2269588792.
Adding to 4253315143 its reverse (3415133524), we get a palindrome (7668448667).
The spelling of 4253315143 in words is "four billion, two hundred fifty-three million, three hundred fifteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •