Base | Representation |
---|---|
bin | 10101010000010101010011… |
… | …01001110001001110110111 |
3 | 20010111100212101100010011122 |
4 | 22220022221221301032313 |
5 | 22111244403141223020 |
6 | 243224212215054155 |
7 | 12562621430151011 |
oct | 1250125151611667 |
9 | 203440771303148 |
10 | 46740680414135 |
11 | 1399067a626394 |
12 | 52aa7a737135b |
13 | 20108200b9356 |
14 | b783922971b1 |
15 | 560c74348125 |
hex | 2a82a9a713b7 |
46740680414135 has 4 divisors (see below), whose sum is σ = 56088816496968. Its totient is φ = 37392544331304.
The previous prime is 46740680414093. The next prime is 46740680414143. The reversal of 46740680414135 is 53141408604764.
46740680414135 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-46740680414135 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 4674068041409 + ... + 4674068041418.
It is an arithmetic number, because the mean of its divisors is an integer number (14022204124242).
Almost surely, 246740680414135 is an apocalyptic number.
46740680414135 is a deficient number, since it is larger than the sum of its proper divisors (9348136082833).
46740680414135 is an equidigital number, since it uses as much as digits as its factorization.
46740680414135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9348136082832.
The product of its (nonzero) digits is 7741440, while the sum is 53.
The spelling of 46740680414135 in words is "forty-six trillion, seven hundred forty billion, six hundred eighty million, four hundred fourteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •