Base | Representation |
---|---|
bin | 101011101000011011… |
… | …000100001110101001 |
3 | 11110220222210222002121 |
4 | 223220123010032221 |
5 | 1231421331113111 |
6 | 33304442231241 |
7 | 3245651425501 |
oct | 535033041651 |
9 | 143828728077 |
10 | 46849082281 |
11 | 189610a3a21 |
12 | 90b57b5521 |
13 | 4558027981 |
14 | 23a6080a01 |
15 | 1342e3e871 |
hex | ae86c43a9 |
46849082281 has 4 divisors (see below), whose sum is σ = 48115273732. Its totient is φ = 45582890832.
The previous prime is 46849082261. The next prime is 46849082317. The reversal of 46849082281 is 18228094864.
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 36351235600 + 10497846681 = 190660^2 + 102459^2 .
It is a cyclic number.
It is not a de Polignac number, because 46849082281 - 229 = 46312211369 is a prime.
It is a super-2 number, since 2×468490822812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (46849082221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 633095670 + ... + 633095743.
It is an arithmetic number, because the mean of its divisors is an integer number (12028818433).
Almost surely, 246849082281 is an apocalyptic number.
It is an amenable number.
46849082281 is a deficient number, since it is larger than the sum of its proper divisors (1266191451).
46849082281 is a wasteful number, since it uses less digits than its factorization.
46849082281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1266191450.
The product of its (nonzero) digits is 1769472, while the sum is 52.
The spelling of 46849082281 in words is "forty-six billion, eight hundred forty-nine million, eighty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •