Base | Representation |
---|---|
bin | 10101000111000000111… |
… | …001101100101011111101 |
3 | 12010200100121201001222222 |
4 | 111013000321230223331 |
5 | 142231402411020334 |
6 | 3030225344415125 |
7 | 206543135231402 |
oct | 25070071545375 |
9 | 5120317631888 |
10 | 1450640329469 |
11 | 50a238714351 |
12 | 1b51886174a5 |
13 | a6a44222c76 |
14 | 502d5dc02a9 |
15 | 27b03d3bd2e |
hex | 151c0e6cafd |
1450640329469 has 2 divisors, whose sum is σ = 1450640329470. Its totient is φ = 1450640329468.
The previous prime is 1450640329417. The next prime is 1450640329487. The reversal of 1450640329469 is 9649230460541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 907183861444 + 543456468025 = 952462^2 + 737195^2 .
It is a cyclic number.
It is not a de Polignac number, because 1450640329469 - 28 = 1450640329213 is a prime.
It is a super-2 number, since 2×14506403294692 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1450640329469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1450640329769) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 725320164734 + 725320164735.
It is an arithmetic number, because the mean of its divisors is an integer number (725320164735).
Almost surely, 21450640329469 is an apocalyptic number.
It is an amenable number.
1450640329469 is a deficient number, since it is larger than the sum of its proper divisors (1).
1450640329469 is an equidigital number, since it uses as much as digits as its factorization.
1450640329469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5598720, while the sum is 53.
The spelling of 1450640329469 in words is "one trillion, four hundred fifty billion, six hundred forty million, three hundred twenty-nine thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •