Base | Representation |
---|---|
bin | 10100000010001110001… |
… | …100110010000011001001 |
3 | 11212121200211112021000102 |
4 | 110002032030302003021 |
5 | 140024113431000441 |
6 | 2532252023415145 |
7 | 201316526352005 |
oct | 24021614620311 |
9 | 4777624467012 |
10 | 1376775250121 |
11 | 490983810a27 |
12 | 1a29b32b44b5 |
13 | 9caa210631b |
14 | 4a8c9d35705 |
15 | 25c2e25769b |
hex | 1408e3320c9 |
1376775250121 has 4 divisors (see below), whose sum is σ = 1377026629572. Its totient is φ = 1376523870672.
The previous prime is 1376775250117. The next prime is 1376775250171. The reversal of 1376775250121 is 1210525776731.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1030348833721 + 346426416400 = 1015061^2 + 588580^2 .
It is a cyclic number.
It is not a de Polignac number, because 1376775250121 - 22 = 1376775250117 is a prime.
It is a super-2 number, since 2×13767752501212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1376775250171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 125681510 + ... + 125692463.
It is an arithmetic number, because the mean of its divisors is an integer number (344256657393).
Almost surely, 21376775250121 is an apocalyptic number.
It is an amenable number.
1376775250121 is a deficient number, since it is larger than the sum of its proper divisors (251379451).
1376775250121 is an equidigital number, since it uses as much as digits as its factorization.
1376775250121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251379450.
The product of its (nonzero) digits is 617400, while the sum is 47.
The spelling of 1376775250121 in words is "one trillion, three hundred seventy-six billion, seven hundred seventy-five million, two hundred fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •