Base | Representation |
---|---|
bin | 1111001100010011… |
… | …0110010010110101 |
3 | 101112012201200202210 |
4 | 3303010312102311 |
5 | 31323000300303 |
6 | 1512400324033 |
7 | 203026366551 |
oct | 36304662265 |
9 | 11465650683 |
10 | 4078134453 |
11 | 1803000858 |
12 | 959913619 |
13 | 4ccb7a913 |
14 | 2a9892861 |
15 | 18d05b203 |
hex | f31364b5 |
4078134453 has 8 divisors (see below), whose sum is σ = 5438802816. Its totient is φ = 2718111200.
The previous prime is 4078134421. The next prime is 4078134479. The reversal of 4078134453 is 3544318704.
4078134453 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4078134453 - 25 = 4078134421 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4078134253) 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, 146328 + ... + 171953.
It is an arithmetic number, because the mean of its divisors is an integer number (679850352).
Almost surely, 24078134453 is an apocalyptic number.
It is an amenable number.
4078134453 is a deficient number, since it is larger than the sum of its proper divisors (1360668363).
4078134453 is a wasteful number, since it uses less digits than its factorization.
4078134453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322555.
The product of its (nonzero) digits is 161280, while the sum is 39.
The square root of 4078134453 is about 63860.2728854176. The cubic root of 4078134453 is about 1597.6703665523.
The spelling of 4078134453 in words is "four billion, seventy-eight million, one hundred thirty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •