Base | Representation |
---|---|
bin | 11110100100000001101… |
… | …00011100000111110111 |
3 | 10201101120120222102111111 |
4 | 33102000310130013313 |
5 | 114201133103004201 |
6 | 2122231412015451 |
7 | 135604165231240 |
oct | 17220064340767 |
9 | 3641516872444 |
10 | 1050133250551 |
11 | 3753a4930070 |
12 | 14b633601587 |
13 | 78047821738 |
14 | 38b80741cc7 |
15 | 1c4b2b7cb51 |
hex | f480d1c1f7 |
1050133250551 has 16 divisors (see below), whose sum is σ = 1341190142208. Its totient is φ = 798327460800.
The previous prime is 1050133250531. The next prime is 1050133250563. The reversal of 1050133250551 is 1550523310501.
1050133250551 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1050133250551 - 225 = 1050099696119 is a prime.
It is a super-2 number, since 2×10501332505512 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050133250521) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 166315065 + ... + 166321378.
It is an arithmetic number, because the mean of its divisors is an integer number (83824383888).
Almost surely, 21050133250551 is an apocalyptic number.
1050133250551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1050133250551 is a deficient number, since it is larger than the sum of its proper divisors (291056891657).
1050133250551 is a wasteful number, since it uses less digits than its factorization.
1050133250551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 332636502.
The product of its (nonzero) digits is 11250, while the sum is 31.
The spelling of 1050133250551 in words is "one trillion, fifty billion, one hundred thirty-three million, two hundred fifty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •