Base | Representation |
---|---|
bin | 100001000010100101111010… |
… | …010111110010010111101011 |
3 | 201001111212000022121001022222 |
4 | 201002211322113302113223 |
5 | 123021304404441102142 |
6 | 1233020103404304255 |
7 | 42415365331351463 |
oct | 4102457227622753 |
9 | 631455008531288 |
10 | 145313681581547 |
11 | 42335205a29796 |
12 | 1436a921b4208b |
13 | 6311037c6603b |
14 | 27c5310c82ba3 |
15 | 11bee205a3bd2 |
hex | 84297a5f25eb |
145313681581547 has 2 divisors, whose sum is σ = 145313681581548. Its totient is φ = 145313681581546.
The previous prime is 145313681581501. The next prime is 145313681581553. The reversal of 145313681581547 is 745185186313541.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 145313681581547 - 28 = 145313681581291 is a prime.
It is a super-2 number, since 2×1453136815815472 (a number of 29 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 145313681581547.
It is not a weakly prime, because it can be changed into another prime (145313681581577) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72656840790773 + 72656840790774.
It is an arithmetic number, because the mean of its divisors is an integer number (72656840790774).
Almost surely, 2145313681581547 is an apocalyptic number.
145313681581547 is a deficient number, since it is larger than the sum of its proper divisors (1).
145313681581547 is an equidigital number, since it uses as much as digits as its factorization.
145313681581547 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 48384000, while the sum is 62.
The spelling of 145313681581547 in words is "one hundred forty-five trillion, three hundred thirteen billion, six hundred eighty-one million, five hundred eighty-one thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •