Base | Representation |
---|---|
bin | 1000011101110010001… |
… | …1001001010010111000 |
3 | 111220101112221211220202 |
4 | 2013130203021102320 |
5 | 4340322113341100 |
6 | 150451141541332 |
7 | 13335664430561 |
oct | 2073443112270 |
9 | 456345854822 |
10 | 145434121400 |
11 | 56750851a67 |
12 | 24229714848 |
13 | 1093964b049 |
14 | 7079217168 |
15 | 3bb2d2b7d5 |
hex | 21dc8c94b8 |
145434121400 has 24 divisors (see below), whose sum is σ = 338134332720. Its totient is φ = 58173648480.
The previous prime is 145434121369. The next prime is 145434121471. The reversal of 145434121400 is 4121434541.
It is a congruent number.
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 5 ways as a sum of consecutive naturals, for example, 363585104 + ... + 363585503.
It is an arithmetic number, because the mean of its divisors is an integer number (14088930530).
Almost surely, 2145434121400 is an apocalyptic number.
145434121400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145434121400 is an abundant number, since it is smaller than the sum of its proper divisors (192700211320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145434121400 is a wasteful number, since it uses less digits than its factorization.
145434121400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 727170623 (or 727170614 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 29.
Adding to 145434121400 its reverse (4121434541), we get a palindrome (149555555941).
It can be divided in two parts, 1454341 and 21400, that added together give a palindrome (1475741).
The spelling of 145434121400 in words is "one hundred forty-five billion, four hundred thirty-four million, one hundred twenty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •