Base | Representation |
---|---|
bin | 10100001000011011010… |
… | …110000101111001001101 |
3 | 11220020220012010111022022 |
4 | 110020123112011321031 |
5 | 140131240142323303 |
6 | 2535313122455525 |
7 | 201643614030245 |
oct | 24103326057115 |
9 | 4806805114268 |
10 | 1383438245453 |
11 | 493792906a40 |
12 | 1a41528045a5 |
13 | a05c4656104 |
14 | 4ad5cc08b25 |
15 | 25ebe1a3438 |
hex | 1421b585e4d |
1383438245453 has 8 divisors (see below), whose sum is σ = 1510043362176. Its totient is φ = 1256972796000.
The previous prime is 1383438245429. The next prime is 1383438245467. The reversal of 1383438245453 is 3545428343831.
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 1383438245453 - 220 = 1383437196877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1383438245395 and 1383438245404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1383438244453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34896101 + ... + 34935722.
It is an arithmetic number, because the mean of its divisors is an integer number (188755420272).
Almost surely, 21383438245453 is an apocalyptic number.
It is an amenable number.
1383438245453 is a deficient number, since it is larger than the sum of its proper divisors (126605116723).
1383438245453 is a wasteful number, since it uses less digits than its factorization.
1383438245453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69833635.
The product of its digits is 16588800, while the sum is 53.
The spelling of 1383438245453 in words is "one trillion, three hundred eighty-three billion, four hundred thirty-eight million, two hundred forty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •