Base | Representation |
---|---|
bin | 1000011101101110111… |
… | …0100000000110110000 |
3 | 111220100120222201121020 |
4 | 2013123232200012300 |
5 | 4340310100234300 |
6 | 150445530055440 |
7 | 13335436223010 |
oct | 2073356400660 |
9 | 456316881536 |
10 | 145420321200 |
11 | 56743a86740 |
12 | 24224b7a580 |
13 | 1093682884b |
14 | 7077463c40 |
15 | 3bb1a028a0 |
hex | 21dbba01b0 |
145420321200 has 240 divisors, whose sum is σ = 580775137536. Its totient is φ = 30217190400.
The previous prime is 145420321171. The next prime is 145420321243. The reversal of 145420321200 is 2123024541.
It is a tau number, because it is divible by the number of its divisors (240).
It is a super-2 number, since 2×1454203212002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 694507 + ... + 879306.
Almost surely, 2145420321200 is an apocalyptic number.
145420321200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145420321200 is an abundant number, since it is smaller than the sum of its proper divisors (435354816336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145420321200 is a wasteful number, since it uses less digits than its factorization.
145420321200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1573852 (or 1573841 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 24.
Adding to 145420321200 its reverse (2123024541), we get a palindrome (147543345741).
The spelling of 145420321200 in words is "one hundred forty-five billion, four hundred twenty million, three hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •