Base | Representation |
---|---|
bin | 101011010001010011… |
… | …110101110000000000 |
3 | 11102220222011012021100 |
4 | 223101103311300000 |
5 | 1230123043441000 |
6 | 33202151054400 |
7 | 3233232431055 |
oct | 532123656000 |
9 | 142828135240 |
10 | 46461312000 |
11 | 18782221414 |
12 | 9007971400 |
13 | 44c58a8abc |
14 | 236a78102c |
15 | 131dd94a00 |
hex | ad14f5c00 |
46461312000 has 528 divisors, whose sum is σ = 172960429824. Its totient is φ = 11980800000.
The previous prime is 46461311987. The next prime is 46461312011. The reversal of 46461312000 is 21316464.
46461312000 is a `hidden beast` number, since 4 + 646 + 1 + 3 + 12 + 0 + 0 + 0 = 666.
It is a super-2 number, since 2×464613120002 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 35711350 + ... + 35712650.
Almost surely, 246461312000 is an apocalyptic number.
46461312000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 46461312000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86480214912).
46461312000 is an abundant number, since it is smaller than the sum of its proper divisors (126499117824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46461312000 is a wasteful number, since it uses less digits than its factorization.
46461312000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1373 (or 1342 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 46461312000 its reverse (21316464), we get a palindrome (46482628464).
The spelling of 46461312000 in words is "forty-six billion, four hundred sixty-one million, three hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •