Base | Representation |
---|---|
bin | 101010110101110110… |
… | …100011100100100101 |
3 | 11101201212100011112112 |
4 | 222311312203210211 |
5 | 1223202131304113 |
6 | 33044333330405 |
7 | 3215640035525 |
oct | 526566434445 |
9 | 141655304475 |
10 | 46000650533 |
11 | 18566193662 |
12 | 8ab9636a05 |
13 | 4451318456 |
14 | 2325509685 |
15 | 12e36ec5a8 |
hex | ab5da3925 |
46000650533 has 4 divisors (see below), whose sum is σ = 46002575820. Its totient is φ = 45998725248.
The previous prime is 46000650529. The next prime is 46000650551. The reversal of 46000650533 is 33505600064.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 28546805764 + 17453844769 = 168958^2 + 132113^2 .
It is a cyclic number.
It is not a de Polignac number, because 46000650533 - 22 = 46000650529 is a prime.
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 46000650533.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46000650583) 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, 926348 + ... + 974741.
It is an arithmetic number, because the mean of its divisors is an integer number (11500643955).
Almost surely, 246000650533 is an apocalyptic number.
It is an amenable number.
46000650533 is a deficient number, since it is larger than the sum of its proper divisors (1925287).
46000650533 is a wasteful number, since it uses less digits than its factorization.
46000650533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1925286.
The product of its (nonzero) digits is 32400, while the sum is 32.
The spelling of 46000650533 in words is "forty-six billion, six hundred fifty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •