Base | Representation |
---|---|
bin | 10100000100000110010… |
… | …000011001101110001101 |
3 | 11212210220012121222100111 |
4 | 110010012100121232031 |
5 | 140042230100334343 |
6 | 2533223535200021 |
7 | 201420455036344 |
oct | 24040620315615 |
9 | 4783805558314 |
10 | 1378789464973 |
11 | 4918177873a8 |
12 | 1a3275976011 |
13 | a00334b982b |
14 | 4aa3b650b5b |
15 | 25ceaec6c9d |
hex | 14106419b8d |
1378789464973 has 2 divisors, whose sum is σ = 1378789464974. Its totient is φ = 1378789464972.
The previous prime is 1378789464967. The next prime is 1378789464979. The reversal of 1378789464973 is 3794649878731.
It is a balanced prime because it is at equal distance from previous prime (1378789464967) and next prime (1378789464979).
It can be written as a sum of positive squares in only one way, i.e., 1278679239369 + 100110225604 = 1130787^2 + 316402^2 .
It is a cyclic number.
It is not a de Polignac number, because 1378789464973 - 225 = 1378755910541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1378789464973.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1378789464979) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 689394732486 + 689394732487.
It is an arithmetic number, because the mean of its divisors is an integer number (689394732487).
Almost surely, 21378789464973 is an apocalyptic number.
It is an amenable number.
1378789464973 is a deficient number, since it is larger than the sum of its proper divisors (1).
1378789464973 is an equidigital number, since it uses as much as digits as its factorization.
1378789464973 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1536288768, while the sum is 76.
The spelling of 1378789464973 in words is "one trillion, three hundred seventy-eight billion, seven hundred eighty-nine million, four hundred sixty-four thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •