Base | Representation |
---|---|
bin | 100000110111000101111111… |
… | …111100011101110010101000 |
3 | 200221201022102021121112121101 |
4 | 200313011333330131302220 |
5 | 122420333112240201300 |
6 | 1231213102502251144 |
7 | 42304323041156635 |
oct | 4067057774356250 |
9 | 627638367545541 |
10 | 144523501100200 |
11 | 42060088718772 |
12 | 14261758126ab4 |
13 | 628467a494b41 |
14 | 2798d90add18c |
15 | 11a95c43bdb6a |
hex | 83717ff1dca8 |
144523501100200 has 48 divisors (see below), whose sum is σ = 341032321284480. Its totient is φ = 56946573562560.
The previous prime is 144523501100171. The next prime is 144523501100219. The reversal of 144523501100200 is 2001105325441.
It is a super-2 number, since 2×1445235011002002 (a number of 29 digits) contains 22 as substring.
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, 5392654552 + ... + 5392681351.
It is an arithmetic number, because the mean of its divisors is an integer number (7104840026760).
Almost surely, 2144523501100200 is an apocalyptic number.
144523501100200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
144523501100200 is an abundant number, since it is smaller than the sum of its proper divisors (196508820184280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144523501100200 is a wasteful number, since it uses less digits than its factorization.
144523501100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10785335986 (or 10785335977 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 144523501100200 its reverse (2001105325441), we get a palindrome (146524606425641).
The spelling of 144523501100200 in words is "one hundred forty-four trillion, five hundred twenty-three billion, five hundred one million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •