Base | Representation |
---|---|
bin | 101011100110010101… |
… | …101000101100010101 |
3 | 11110211112222220101100 |
4 | 223212111220230111 |
5 | 1231333402314331 |
6 | 33301152420313 |
7 | 3245045215134 |
oct | 534625505425 |
9 | 143745886340 |
10 | 46814104341 |
11 | 18943383534 |
12 | 90a5b47699 |
13 | 45509cbc74 |
14 | 23a157791b |
15 | 133ed30ae6 |
hex | ae6568b15 |
46814104341 has 12 divisors (see below), whose sum is σ = 67645573632. Its totient is φ = 31197771816.
The previous prime is 46814104327. The next prime is 46814104349. The reversal of 46814104341 is 14340141864.
It is a happy number.
46814104341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 46814104341 - 225 = 46780549909 is a prime.
It is a super-3 number, since 3×468141043413 (a number of 33 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 46814104296 and 46814104305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46814104349) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 943731 + ... + 992096.
It is an arithmetic number, because the mean of its divisors is an integer number (5637131136).
Almost surely, 246814104341 is an apocalyptic number.
It is an amenable number.
46814104341 is a deficient number, since it is larger than the sum of its proper divisors (20831469291).
46814104341 is a wasteful number, since it uses less digits than its factorization.
46814104341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1938520 (or 1938517 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 36.
The spelling of 46814104341 in words is "forty-six billion, eight hundred fourteen million, one hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •