Base | Representation |
---|---|
bin | 11111010010100001111… |
… | …110000101101111001000 |
3 | 21121120001012122002002120 |
4 | 133102201332011233020 |
5 | 240212102432244300 |
6 | 4323442210531240 |
7 | 311226662263011 |
oct | 37224176055710 |
9 | 7546035562076 |
10 | 2150201056200 |
11 | 75999349348a |
12 | 2a8881b96b20 |
13 | 1279bc67a7a2 |
14 | 760dac1a008 |
15 | 3ade95743a0 |
hex | 1f4a1f85bc8 |
2150201056200 has 144 divisors (see below), whose sum is σ = 6832167929040. Its totient is φ = 559401638400.
The previous prime is 2150201056193. The next prime is 2150201056219. The reversal of 2150201056200 is 26501020512.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 57334 + ... + 2074533.
Almost surely, 22150201056200 is an apocalyptic number.
2150201056200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2150201056200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3416083964520).
2150201056200 is an abundant number, since it is smaller than the sum of its proper divisors (4681966872840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2150201056200 is a wasteful number, since it uses less digits than its factorization.
2150201056200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2131968 (or 2131918 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 2150201056200 its reverse (26501020512), we get a palindrome (2176702076712).
The spelling of 2150201056200 in words is "two trillion, one hundred fifty billion, two hundred one million, fifty-six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •