Base | Representation |
---|---|
bin | 100000111110110100001010… |
… | …111100101000011000010000 |
3 | 201000121001000121200111221022 |
4 | 200332310022330220120100 |
5 | 123003031311210412000 |
6 | 1232300535021415012 |
7 | 42360546112543112 |
oct | 4076641274503020 |
9 | 630531017614838 |
10 | 145054114154000 |
11 | 42245116983627 |
12 | 1432856140a468 |
13 | 62c270c9c411c |
14 | 27b69299513b2 |
15 | 11b82cc876585 |
hex | 83ed0af28610 |
145054114154000 has 40 divisors (see below), whose sum is σ = 350740848029208. Its totient is φ = 58021645660800.
The previous prime is 145054114153999. The next prime is 145054114154009. The reversal of 145054114154000 is 451411450541.
It can be written as a sum of positive squares in 4 ways, for example, as 1086464336896 + 143967649817104 = 1042336^2 + 11998652^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is not an unprimeable number, because it can be changed into a prime (145054114154009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36263526539 + ... + 36263530538.
Almost surely, 2145054114154000 is an apocalyptic number.
145054114154000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145054114154000 is an abundant number, since it is smaller than the sum of its proper divisors (205686733875208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145054114154000 is an equidigital number, since it uses as much as digits as its factorization.
145054114154000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72527057100 (or 72527057084 counting only the distinct ones).
The product of its (nonzero) digits is 32000, while the sum is 35.
The spelling of 145054114154000 in words is "one hundred forty-five trillion, fifty-four billion, one hundred fourteen million, one hundred fifty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •