Base | Representation |
---|---|
bin | 11110100100001011010… |
… | …01101111111010100011 |
3 | 10201101210020112220020110 |
4 | 33102011221233322203 |
5 | 114201314332142430 |
6 | 2122243425542403 |
7 | 135606201356412 |
oct | 17220551577243 |
9 | 3641706486213 |
10 | 1050214334115 |
11 | 375436681381 |
12 | 14b6567a4a03 |
13 | 7805b57108b |
14 | 38b8b40b479 |
15 | 1c4b9d477b0 |
hex | f485a6fea3 |
1050214334115 has 32 divisors (see below), whose sum is σ = 1695164889600. Its totient is φ = 555193790720.
The previous prime is 1050214334111. The next prime is 1050214334153. The reversal of 1050214334115 is 5114334120501.
It is not a de Polignac number, because 1050214334115 - 22 = 1050214334111 is a prime.
It is a super-2 number, since 2×10502143341152 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1050214334111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 206191 + ... + 1463879.
It is an arithmetic number, because the mean of its divisors is an integer number (52973902800).
Almost surely, 21050214334115 is an apocalyptic number.
1050214334115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1050214334115 is a deficient number, since it is larger than the sum of its proper divisors (644950555485).
1050214334115 is a wasteful number, since it uses less digits than its factorization.
1050214334115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1258187.
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 1050214334115 its reverse (5114334120501), we get a palindrome (6164548454616).
The spelling of 1050214334115 in words is "one trillion, fifty billion, two hundred fourteen million, three hundred thirty-four thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •