Base | Representation |
---|---|
bin | 100000001010001110010011… |
… | …100101101001001001100000 |
3 | 200112210112110212100120122212 |
4 | 200022032103211221021200 |
5 | 122014323202300040300 |
6 | 1220452354222421252 |
7 | 41535464101402235 |
oct | 4012162345511140 |
9 | 615715425316585 |
10 | 141440044143200 |
11 | 41081427647a60 |
12 | 13a44040731828 |
13 | 60bc97b58445a |
14 | 26cda3dcb578c |
15 | 11542a7e52935 |
hex | 80a393969260 |
141440044143200 has 72 divisors (see below), whose sum is σ = 376680553948440. Its totient is φ = 51432743321600.
The previous prime is 141440044143187. The next prime is 141440044143227. The reversal of 141440044143200 is 2341440044141.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8036357345 + ... + 8036374944.
It is an arithmetic number, because the mean of its divisors is an integer number (5231674360395).
Almost surely, 2141440044143200 is an apocalyptic number.
141440044143200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141440044143200 is an abundant number, since it is smaller than the sum of its proper divisors (235240509805240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141440044143200 is a wasteful number, since it uses less digits than its factorization.
141440044143200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16072732320 (or 16072732307 counting only the distinct ones).
The product of its (nonzero) digits is 24576, while the sum is 32.
Adding to 141440044143200 its reverse (2341440044141), we get a palindrome (143781484187341).
The spelling of 141440044143200 in words is "one hundred forty-one trillion, four hundred forty billion, forty-four million, one hundred forty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •