Base | Representation |
---|---|
bin | 10101000101010101111010… |
… | …00100010110101001010101 |
3 | 20002011021010121021002001201 |
4 | 22202222331010112221111 |
5 | 22034103011022400211 |
6 | 242334520215552501 |
7 | 12523422401300134 |
oct | 1242527504265125 |
9 | 202137117232051 |
10 | 46363049028181 |
11 | 13855505548886 |
12 | 524957738b731 |
13 | 1cb402aaa2812 |
14 | b63daabc991b |
15 | 5560215e20c1 |
hex | 2a2abd116a55 |
46363049028181 has 4 divisors (see below), whose sum is σ = 46365462909472. Its totient is φ = 46360635146892.
The previous prime is 46363049028167. The next prime is 46363049028187. The reversal of 46363049028181 is 18182094036364.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 46363049028181 - 27 = 46363049028053 is a prime.
It is a super-2 number, since 2×463630490281812 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46363049028187) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1206911835 + ... + 1206950248.
It is an arithmetic number, because the mean of its divisors is an integer number (11591365727368).
Almost surely, 246363049028181 is an apocalyptic number.
It is an amenable number.
46363049028181 is a deficient number, since it is larger than the sum of its proper divisors (2413881291).
46363049028181 is a wasteful number, since it uses less digits than its factorization.
46363049028181 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2413881290.
The product of its (nonzero) digits is 5971968, while the sum is 55.
The spelling of 46363049028181 in words is "forty-six trillion, three hundred sixty-three billion, forty-nine million, twenty-eight thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •