Base | Representation |
---|---|
bin | 1111011110010000… |
… | …0010100111010011 |
3 | 101201110101121110101 |
4 | 3313210002213103 |
5 | 32001233421433 |
6 | 1524050113231 |
7 | 204632326630 |
oct | 36744024723 |
9 | 11643347411 |
10 | 4153420243 |
11 | 1841552115 |
12 | 97ab7b817 |
13 | 51264a31b |
14 | 2b588d187 |
15 | 19497d07d |
hex | f79029d3 |
4153420243 has 8 divisors (see below), whose sum is σ = 4749696512. Its totient is φ = 3557876616.
The previous prime is 4153420231. The next prime is 4153420283. The reversal of 4153420243 is 3420243514.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4153420243 - 25 = 4153420211 is a prime.
It is a super-3 number, since 3×41534202433 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4153420283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 170955 + ... + 193732.
It is an arithmetic number, because the mean of its divisors is an integer number (593712064).
Almost surely, 24153420243 is an apocalyptic number.
4153420243 is a deficient number, since it is larger than the sum of its proper divisors (596276269).
4153420243 is a wasteful number, since it uses less digits than its factorization.
4153420243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366321.
The product of its (nonzero) digits is 11520, while the sum is 28.
The square root of 4153420243 is about 64447.0344003508. The cubic root of 4153420243 is about 1607.4419265559.
Adding to 4153420243 its reverse (3420243514), we get a palindrome (7573663757).
The spelling of 4153420243 in words is "four billion, one hundred fifty-three million, four hundred twenty thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •