Base | Representation |
---|---|
bin | 11110100100000011001… |
… | …01100110000111100010 |
3 | 10201101121111020002202120 |
4 | 33102001211212013202 |
5 | 114201144402332141 |
6 | 2122232552125110 |
7 | 135604412610603 |
oct | 17220145460742 |
9 | 3641544202676 |
10 | 1050146136546 |
11 | 375401131551 |
12 | 14b637996796 |
13 | 7804a3b3aa0 |
14 | 38b82337daa |
15 | 1c4b3d75c66 |
hex | f4819661e2 |
1050146136546 has 64 divisors (see below), whose sum is σ = 2282773304448. Its totient is φ = 320135574528.
The previous prime is 1050146136527. The next prime is 1050146136581. The reversal of 1050146136546 is 6456316410501.
It is a super-3 number, since 3×10501461365463 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1050146136498 and 1050146136507.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23572825 + ... + 23617331.
It is an arithmetic number, because the mean of its divisors is an integer number (35668332882).
Almost surely, 21050146136546 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1050146136546, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1141386652224).
1050146136546 is an abundant number, since it is smaller than the sum of its proper divisors (1232627167902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1050146136546 is a wasteful number, since it uses less digits than its factorization.
1050146136546 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47315.
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 1050146136546 in words is "one trillion, fifty billion, one hundred forty-six million, one hundred thirty-six thousand, five hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •