Base | Representation |
---|---|
bin | 101011010100010111… |
… | …100100000111110101 |
3 | 11110001112200220122102 |
4 | 223110113210013311 |
5 | 1230224212320041 |
6 | 33211222511445 |
7 | 3234424514120 |
oct | 532427440765 |
9 | 143045626572 |
10 | 46512620021 |
11 | 187a918593a |
12 | 9020b95585 |
13 | 450340168a |
14 | 23734d93b7 |
15 | 132362c09b |
hex | ad45e41f5 |
46512620021 has 32 divisors (see below), whose sum is σ = 57417984000. Its totient is φ = 36795971520.
The previous prime is 46512619961. The next prime is 46512620053. The reversal of 46512620021 is 12002621564.
It is a de Polignac number, because none of the positive numbers 2k-46512620021 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46512620221) 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 31 ways as a sum of consecutive naturals, for example, 12599786 + ... + 12603476.
It is an arithmetic number, because the mean of its divisors is an integer number (1794312000).
Almost surely, 246512620021 is an apocalyptic number.
It is an amenable number.
46512620021 is a deficient number, since it is larger than the sum of its proper divisors (10905363979).
46512620021 is a wasteful number, since it uses less digits than its factorization.
46512620021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6449.
The product of its (nonzero) digits is 5760, while the sum is 29.
The spelling of 46512620021 in words is "forty-six billion, five hundred twelve million, six hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •