Base | Representation |
---|---|
bin | 10100000001110111000… |
… | …101101000100011011001 |
3 | 11212120200210220112012001 |
4 | 110001313011220203121 |
5 | 140022320200001444 |
6 | 2532145332521001 |
7 | 201304110500626 |
oct | 24016705504331 |
9 | 4776623815161 |
10 | 1376387500249 |
11 | 4907a4952793 |
12 | 1a2905480161 |
13 | 9ca3c993828 |
14 | 4a89063d34d |
15 | 25c0a1b38d4 |
hex | 140771688d9 |
1376387500249 has 8 divisors (see below), whose sum is σ = 1376765633600. Its totient is φ = 1376009434800.
The previous prime is 1376387500223. The next prime is 1376387500283. The reversal of 1376387500249 is 9420057836731.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1376387500249 - 219 = 1376386975961 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1376387500249.
It is not an unprimeable number, because it can be changed into a prime (1376387501249) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 102716452 + ... + 102729850.
It is an arithmetic number, because the mean of its divisors is an integer number (172095704200).
It is a 1-persistent number, because it is pandigital, but 2⋅1376387500249 = 2752775000498 is not.
Almost surely, 21376387500249 is an apocalyptic number.
It is an amenable number.
1376387500249 is a deficient number, since it is larger than the sum of its proper divisors (378133351).
1376387500249 is a wasteful number, since it uses less digits than its factorization.
1376387500249 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33951.
The product of its (nonzero) digits is 7620480, while the sum is 55.
The spelling of 1376387500249 in words is "one trillion, three hundred seventy-six billion, three hundred eighty-seven million, five hundred thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •