Base | Representation |
---|---|
bin | 101011001010100100… |
… | …100101010100000000 |
3 | 11102122002102120220202 |
4 | 223022210211110000 |
5 | 1224410123314413 |
6 | 33143032024332 |
7 | 3230360500136 |
oct | 531244452400 |
9 | 142562376822 |
10 | 46348260608 |
11 | 18724426211 |
12 | 8b95b320a8 |
13 | 44a83458a0 |
14 | 2359753756 |
15 | 1313eb2e58 |
hex | aca925500 |
46348260608 has 72 divisors (see below), whose sum is σ = 99948619848. Its totient is φ = 21323538432.
The previous prime is 46348260593. The next prime is 46348260619. The reversal of 46348260608 is 80606284364.
It can be written as a sum of positive squares in 4 ways, for example, as 6079009024 + 40269251584 = 77968^2 + 200672^2 .
It is a super-2 number, since 2×463482606082 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1033010 + ... + 1076942.
Almost surely, 246348260608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 46348260608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49974309924).
46348260608 is an abundant number, since it is smaller than the sum of its proper divisors (53600359240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46348260608 is a wasteful number, since it uses less digits than its factorization.
46348260608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44279 (or 44265 counting only the distinct ones).
The product of its (nonzero) digits is 1327104, while the sum is 47.
The spelling of 46348260608 in words is "forty-six billion, three hundred forty-eight million, two hundred sixty thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •