Base | Representation |
---|---|
bin | 11110100101100110000… |
… | …00000100000000000000 |
3 | 10201110202021011202202221 |
4 | 33102303000010000000 |
5 | 114204344120031042 |
6 | 2122451125020424 |
7 | 135634100306554 |
oct | 17226300040000 |
9 | 3643667152687 |
10 | 1050975158272 |
11 | 375797094876 |
12 | 14b829554714 |
13 | 781500885a0 |
14 | 38c20499864 |
15 | 1c511a31d67 |
hex | f4b3004000 |
1050975158272 has 60 divisors (see below), whose sum is σ = 2263570180396. Its totient is φ = 485065359360.
The previous prime is 1050975158267. The next prime is 1050975158273. The reversal of 1050975158272 is 2728515790501.
It can be written as a sum of positive squares in 2 ways, for example, as 318348722176 + 732626436096 = 564224^2 + 855936^2 .
It is a super-2 number, since 2×10509751582722 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is not an unprimeable number, because it can be changed into a prime (1050975158273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2254179 + ... + 2680162.
Almost surely, 21050975158272 is an apocalyptic number.
It is an amenable number.
1050975158272 is an abundant number, since it is smaller than the sum of its proper divisors (1212595022124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1050975158272 is an frugal number, since it uses more digits than its factorization.
1050975158272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4934382 (or 4934356 counting only the distinct ones).
The product of its (nonzero) digits is 1764000, while the sum is 52.
The spelling of 1050975158272 in words is "one trillion, fifty billion, nine hundred seventy-five million, one hundred fifty-eight thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •