Base | Representation |
---|---|
bin | 10101000010110100111… |
… | …111000010010111000001 |
3 | 12010020202100202210001202 |
4 | 111002310333002113001 |
5 | 142143201212410243 |
6 | 3024203335310545 |
7 | 206323555244123 |
oct | 25026477022701 |
9 | 5106670683052 |
10 | 1446145435073 |
11 | 508341440699 |
12 | 1b433321b455 |
13 | a64a8c16341 |
14 | 4ddcb043213 |
15 | 2793e40b4b8 |
hex | 150b4fc25c1 |
1446145435073 has 2 divisors, whose sum is σ = 1446145435074. Its totient is φ = 1446145435072.
The previous prime is 1446145435037. The next prime is 1446145435093. The reversal of 1446145435073 is 3705345416441.
It is a happy number.
Together with previous prime (1446145435037) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1355669006224 + 90476428849 = 1164332^2 + 300793^2 .
It is a cyclic number.
It is not a de Polignac number, because 1446145435073 - 210 = 1446145434049 is a prime.
It is not a weakly prime, because it can be changed into another prime (1446145435093) 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 as a sum of consecutive naturals, namely, 723072717536 + 723072717537.
It is an arithmetic number, because the mean of its divisors is an integer number (723072717537).
Almost surely, 21446145435073 is an apocalyptic number.
It is an amenable number.
1446145435073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1446145435073 is an equidigital number, since it uses as much as digits as its factorization.
1446145435073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2419200, while the sum is 47.
The spelling of 1446145435073 in words is "one trillion, four hundred forty-six billion, one hundred forty-five million, four hundred thirty-five thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •