Base | Representation |
---|---|
bin | 100111111101010100… |
… | …011011001010011101 |
3 | 11002202002202100120120 |
4 | 213331110123022131 |
5 | 1200332100223303 |
6 | 31413220305153 |
7 | 3046134615444 |
oct | 477524331235 |
9 | 132662670516 |
10 | 42904695453 |
11 | 172176447a4 |
12 | 83948421b9 |
13 | 4079aa8579 |
14 | 2110285d5b |
15 | 11b1a02553 |
hex | 9fd51b29d |
42904695453 has 32 divisors (see below), whose sum is σ = 59450976000. Its totient is φ = 27490176000.
The previous prime is 42904695451. The next prime is 42904695487. The reversal of 42904695453 is 35459640924.
It is not a de Polignac number, because 42904695453 - 21 = 42904695451 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42904695396 and 42904695405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42904695451) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22012723 + ... + 22014671.
It is an arithmetic number, because the mean of its divisors is an integer number (1857843000).
Almost surely, 242904695453 is an apocalyptic number.
It is an amenable number.
42904695453 is a deficient number, since it is larger than the sum of its proper divisors (16546280547).
42904695453 is a wasteful number, since it uses less digits than its factorization.
42904695453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3013.
The product of its (nonzero) digits is 4665600, while the sum is 51.
The spelling of 42904695453 in words is "forty-two billion, nine hundred four million, six hundred ninety-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •