Base | Representation |
---|---|
bin | 10111111010000011011001… |
… | …001011001110000101000000 |
3 | 111210021201012000102111001011 |
4 | 113322003121023032011000 |
5 | 102240141304402100300 |
6 | 1011342405034050304 |
7 | 31101302213155666 |
oct | 2772033113160500 |
9 | 453251160374034 |
10 | 105144443003200 |
11 | 30558564a68947 |
12 | b961845279994 |
13 | 468910340a973 |
14 | 1bd7037cd6c36 |
15 | c250acce2eba |
hex | 5fa0d92ce140 |
105144443003200 has 84 divisors (see below), whose sum is σ = 272337942252160. Its totient is φ = 39844209968640.
The previous prime is 105144443003087. The next prime is 105144443003209. The reversal of 105144443003200 is 2300344441501.
It is a super-2 number, since 2×1051444430032002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105144443003209) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1729318992 + ... + 1729379791.
Almost surely, 2105144443003200 is an apocalyptic number.
105144443003200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105144443003200 is an abundant number, since it is smaller than the sum of its proper divisors (167193499248960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105144443003200 is a wasteful number, since it uses less digits than its factorization.
105144443003200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3458698824 (or 3458698809 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 105144443003200 its reverse (2300344441501), we get a palindrome (107444787444701).
The spelling of 105144443003200 in words is "one hundred five trillion, one hundred forty-four billion, four hundred forty-three million, three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •