Base | Representation |
---|---|
bin | 111011101110101000110… |
… | …000111000011100000011 |
3 | 112112101111102012200120001 |
4 | 323232220300320130003 |
5 | 1014222031414412201 |
6 | 12421332014500431 |
7 | 602353650105430 |
oct | 73565060703403 |
9 | 15471442180501 |
10 | 4104525154051 |
11 | 13427a0498a03 |
12 | 563599204717 |
13 | 23a093c7b00a |
14 | 102935376b87 |
15 | 71b7c601301 |
hex | 3bba8c38703 |
4104525154051 has 16 divisors (see below), whose sum is σ = 4807627711488. Its totient is φ = 3430691265600.
The previous prime is 4104525154001. The next prime is 4104525154061. The reversal of 4104525154051 is 1504515254014.
4104525154051 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 not a de Polignac number, because 4104525154051 - 225 = 4104491599619 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4104525154051.
It is not an unprimeable number, because it can be changed into a prime (4104525154001) 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, 2874105 + ... + 4058266.
It is an arithmetic number, because the mean of its divisors is an integer number (300476731968).
Almost surely, 24104525154051 is an apocalyptic number.
4104525154051 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
4104525154051 is a deficient number, since it is larger than the sum of its proper divisors (703102557437).
4104525154051 is a wasteful number, since it uses less digits than its factorization.
4104525154051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6934482.
The product of its (nonzero) digits is 80000, while the sum is 37.
The spelling of 4104525154051 in words is "four trillion, one hundred four billion, five hundred twenty-five million, one hundred fifty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •