Base | Representation |
---|---|
bin | 10001010100111… |
… | …00101101110110 |
3 | 101010111022101220 |
4 | 20222130231312 |
5 | 244202023043 |
6 | 22231131210 |
7 | 3413262342 |
oct | 1052345566 |
9 | 333438356 |
10 | 145345398 |
11 | 75053170 |
12 | 40813b06 |
13 | 2415c3c3 |
14 | 15436622 |
15 | cb60483 |
hex | 8a9cb76 |
145345398 has 64 divisors (see below), whose sum is σ = 332128512. Its totient is φ = 42007680.
The previous prime is 145345381. The next prime is 145345399. The reversal of 145345398 is 893543541.
It is a super-2 number, since 2×1453453982 = 42250569439556808, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145345399) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 128865 + ... + 129987.
It is an arithmetic number, because the mean of its divisors is an integer number (5189508).
Almost surely, 2145345398 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 145345398, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166064256).
145345398 is an abundant number, since it is smaller than the sum of its proper divisors (186783114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145345398 is a wasteful number, since it uses less digits than its factorization.
145345398 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1229.
The product of its digits is 259200, while the sum is 42.
The square root of 145345398 is about 12055.9279194926. The cubic root of 145345398 is about 525.7756010053.
It can be divided in two parts, 145 and 345398, that added together give a palindrome (345543).
The spelling of 145345398 in words is "one hundred forty-five million, three hundred forty-five thousand, three hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •