Base | Representation |
---|---|
bin | 101011001000100110… |
… | …001001011001100111 |
3 | 11102112210001200020200 |
4 | 223020212021121213 |
5 | 1224323132204020 |
6 | 33135445401543 |
7 | 3226505664051 |
oct | 531046113147 |
9 | 142483050220 |
10 | 46315116135 |
11 | 18707748292 |
12 | 8b86a092b3 |
13 | 44a150c582 |
14 | 23551a68d1 |
15 | 1311117590 |
hex | ac8989667 |
46315116135 has 48 divisors (see below), whose sum is σ = 80929446624. Its totient is φ = 24502173696.
The previous prime is 46315116007. The next prime is 46315116143. The reversal of 46315116135 is 53161151364.
46315116135 is a `hidden beast` number, since 4 + 6 + 3 + 1 + 511 + 6 + 135 = 666.
It is not a de Polignac number, because 46315116135 - 27 = 46315116007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 46315116135.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3058252 + ... + 3073358.
It is an arithmetic number, because the mean of its divisors is an integer number (1686030138).
Almost surely, 246315116135 is an apocalyptic number.
46315116135 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
46315116135 is a deficient number, since it is larger than the sum of its proper divisors (34614330489).
46315116135 is a wasteful number, since it uses less digits than its factorization.
46315116135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15664 (or 15661 counting only the distinct ones).
The product of its digits is 32400, while the sum is 36.
Adding to 46315116135 its reverse (53161151364), we get a palindrome (99476267499).
The spelling of 46315116135 in words is "forty-six billion, three hundred fifteen million, one hundred sixteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •