Base | Representation |
---|---|
bin | 1000011101101010100… |
… | …0011001000111000101 |
3 | 111220022022101222201111 |
4 | 2013122220121013011 |
5 | 4340240344124334 |
6 | 150444032125021 |
7 | 13335124055500 |
oct | 2073250310705 |
9 | 456268358644 |
10 | 145401942469 |
11 | 56734673503 |
12 | 2421a996771 |
13 | 10932a92364 |
14 | 7074c3c137 |
15 | 3bb00c2064 |
hex | 21daa191c5 |
145401942469 has 18 divisors (see below), whose sum is σ = 170117530674. Its totient is φ = 123911061120.
The previous prime is 145401942467. The next prime is 145401942527. The reversal of 145401942469 is 964249104541.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 6673256100 + 138728686369 = 81690^2 + 372463^2 .
It is not a de Polignac number, because 145401942469 - 21 = 145401942467 is a prime.
It is a super-2 number, since 2×1454019424692 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145401942467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 35908557 + ... + 35912605.
Almost surely, 2145401942469 is an apocalyptic number.
It is an amenable number.
145401942469 is a deficient number, since it is larger than the sum of its proper divisors (24715588205).
145401942469 is an frugal number, since it uses more digits than its factorization.
145401942469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8293 (or 4237 counting only the distinct ones).
The product of its (nonzero) digits is 1244160, while the sum is 49.
The spelling of 145401942469 in words is "one hundred forty-five billion, four hundred one million, nine hundred forty-two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •