Base | Representation |
---|---|
bin | 101011011100011111… |
… | …101100111100000101 |
3 | 11110102001021021001011 |
4 | 223130133230330011 |
5 | 1231014114033023 |
6 | 33232533202221 |
7 | 3241001465641 |
oct | 533437547405 |
9 | 143361237034 |
10 | 46648971013 |
11 | 18869145407 |
12 | 905a790371 |
13 | 4525731b38 |
14 | 238766dc21 |
15 | 13305b250d |
hex | adc7ecf05 |
46648971013 has 32 divisors (see below), whose sum is σ = 50273245440. Its totient is φ = 43179333120.
The previous prime is 46648971007. The next prime is 46648971029. The reversal of 46648971013 is 31017984664.
It is a cyclic number.
It is not a de Polignac number, because 46648971013 - 225 = 46615416581 is a prime.
It is a super-2 number, since 2×466489710132 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46648971043) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 63640795 + ... + 63641527.
It is an arithmetic number, because the mean of its divisors is an integer number (1571038920).
Almost surely, 246648971013 is an apocalyptic number.
46648971013 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
46648971013 is a deficient number, since it is larger than the sum of its proper divisors (3624274427).
46648971013 is a wasteful number, since it uses less digits than its factorization.
46648971013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1309.
The product of its (nonzero) digits is 870912, while the sum is 49.
The spelling of 46648971013 in words is "forty-six billion, six hundred forty-eight million, nine hundred seventy-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •