Base | Representation |
---|---|
bin | 10100111110001010000000… |
… | …11110010000100011110011 |
3 | 20001021122211110202212102121 |
4 | 22133011000132100203303 |
5 | 22021031331223443443 |
6 | 242025244221055111 |
7 | 12466532035221553 |
oct | 1237050036204363 |
9 | 201248743685377 |
10 | 46116145531123 |
11 | 1376a8249a8078 |
12 | 520974b9b7497 |
13 | 1c969703b5cb5 |
14 | b56067741163 |
15 | 54e8c05804ed |
hex | 29f1407908f3 |
46116145531123 has 16 divisors (see below), whose sum is σ = 48851228701440. Its totient is φ = 43442216791776.
The previous prime is 46116145531121. The next prime is 46116145531147. The reversal of 46116145531123 is 32113554161164.
It is a cyclic number.
It is not a de Polignac number, because 46116145531123 - 21 = 46116145531121 is a prime.
It is a super-2 number, since 2×461161455311232 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 46116145531123.
It is not an unprimeable number, because it can be changed into a prime (46116145531121) 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, 2763061 + ... + 9993337.
It is an arithmetic number, because the mean of its divisors is an integer number (3053201793840).
Almost surely, 246116145531123 is an apocalyptic number.
46116145531123 is a deficient number, since it is larger than the sum of its proper divisors (2735083170317).
46116145531123 is a wasteful number, since it uses less digits than its factorization.
46116145531123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7234506.
The product of its digits is 259200, while the sum is 43.
Adding to 46116145531123 its reverse (32113554161164), we get a palindrome (78229699692287).
The spelling of 46116145531123 in words is "forty-six trillion, one hundred sixteen billion, one hundred forty-five million, five hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •