Base | Representation |
---|---|
bin | 100001000010100101111010… |
… | …010111110010010111000000 |
3 | 201001111212000022121001021101 |
4 | 201002211322113302113000 |
5 | 123021304404441102004 |
6 | 1233020103404304144 |
7 | 42415365331351402 |
oct | 4102457227622700 |
9 | 631455008531241 |
10 | 145313681581504 |
11 | 42335205a29757 |
12 | 1436a921b42054 |
13 | 6311037c66007 |
14 | 27c5310c82b72 |
15 | 11bee205a3ba4 |
hex | 84297a5f25c0 |
145313681581504 has 28 divisors (see below), whose sum is σ = 288930110981904. Its totient is φ = 72512393775104.
The previous prime is 145313681581501. The next prime is 145313681581547. The reversal of 145313681581504 is 405185186313541.
It is a happy number.
It is a super-2 number, since 2×1453136815815042 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145313681581501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2256952177 + ... + 2257016560.
It is an arithmetic number, because the mean of its divisors is an integer number (10318932535068).
Almost surely, 2145313681581504 is an apocalyptic number.
It is an amenable number.
145313681581504 is a deficient number, since it is larger than the sum of its proper divisors (143616429400400).
145313681581504 is an equidigital number, since it uses as much as digits as its factorization.
145313681581504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4513969252 (or 4513969242 counting only the distinct ones).
The product of its (nonzero) digits is 6912000, while the sum is 55.
The spelling of 145313681581504 in words is "one hundred forty-five trillion, three hundred thirteen billion, six hundred eighty-one million, five hundred eighty-one thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •