Base | Representation |
---|---|
bin | 101010111010010100… |
… | …111000111001001011 |
3 | 11101221002120122012201 |
4 | 222322110320321023 |
5 | 1223330340223201 |
6 | 33100014221031 |
7 | 3220541040046 |
oct | 527224707113 |
9 | 141832518181 |
10 | 46075711051 |
11 | 185a45a0747 |
12 | 8b1a7b4777 |
13 | 4463a39466 |
14 | 2331487c5d |
15 | 12ea0c7801 |
hex | aba538e4b |
46075711051 has 4 divisors (see below), whose sum is σ = 46076141592. Its totient is φ = 46075280512.
The previous prime is 46075711049. The next prime is 46075711061. The reversal of 46075711051 is 15011757064.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 46075711051 - 21 = 46075711049 is a prime.
It is a super-2 number, since 2×460757110512 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 46075711051.
It is not an unprimeable number, because it can be changed into a prime (46075711021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83196 + ... + 314758.
It is an arithmetic number, because the mean of its divisors is an integer number (11519035398).
Almost surely, 246075711051 is an apocalyptic number.
46075711051 is a deficient number, since it is larger than the sum of its proper divisors (430541).
46075711051 is a wasteful number, since it uses less digits than its factorization.
46075711051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430540.
The product of its (nonzero) digits is 29400, while the sum is 37.
The spelling of 46075711051 in words is "forty-six billion, seventy-five million, seven hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •