Base | Representation |
---|---|
bin | 10100111101111001100100… |
… | …01000100010011001110011 |
3 | 20001020211001001121111101221 |
4 | 22132330302020202121303 |
5 | 22020410240121141202 |
6 | 242021224052405511 |
7 | 12466100151144412 |
oct | 1236746210423163 |
9 | 201224031544357 |
10 | 46107315021427 |
11 | 13767003350480 |
12 | 5207aa6616897 |
13 | 1c95b93a9a02a |
14 | b5586aa49479 |
15 | 54e5551d3037 |
hex | 29ef32222673 |
46107315021427 has 8 divisors (see below), whose sum is σ = 50300508741120. Its totient is φ = 41914391239560.
The previous prime is 46107315021373. The next prime is 46107315021433. The reversal of 46107315021427 is 72412051370164.
46107315021427 is digitally balanced in base 2, 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 46107315021427 - 235 = 46072955283059 is a prime.
It is not an unprimeable number, because it can be changed into a prime (46107315021827) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67127227 + ... + 67810612.
It is an arithmetic number, because the mean of its divisors is an integer number (6287563592640).
Almost surely, 246107315021427 is an apocalyptic number.
46107315021427 is a deficient number, since it is larger than the sum of its proper divisors (4193193719693).
46107315021427 is a wasteful number, since it uses less digits than its factorization.
46107315021427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134968913.
The product of its (nonzero) digits is 282240, while the sum is 43.
The spelling of 46107315021427 in words is "forty-six trillion, one hundred seven billion, three hundred fifteen million, twenty-one thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •