Base | Representation |
---|---|
bin | 11110100101100101000… |
… | …110110111111100000110 |
3 | 21102221110111010001110020 |
4 | 132211211012313330012 |
5 | 233414230414333200 |
6 | 4245341000240010 |
7 | 304600626221400 |
oct | 36454506677406 |
9 | 7387414101406 |
10 | 2101935308550 |
11 | 740475758940 |
12 | 29b451a70006 |
13 | 123299cba9ac |
14 | 73a3c969b70 |
15 | 39a2209bea0 |
hex | 1e9651b7f06 |
2101935308550 has 288 divisors, whose sum is σ = 6618497817600. Its totient is φ = 436543430400.
The previous prime is 2101935308533. The next prime is 2101935308591. The reversal of 2101935308550 is 558035391012.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 193953732 + ... + 193964568.
It is an arithmetic number, because the mean of its divisors is an integer number (22980895200).
Almost surely, 22101935308550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2101935308550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3309248908800).
2101935308550 is an abundant number, since it is smaller than the sum of its proper divisors (4516562509050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101935308550 is a wasteful number, since it uses less digits than its factorization.
2101935308550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13276 (or 13264 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 42.
The spelling of 2101935308550 in words is "two trillion, one hundred one billion, nine hundred thirty-five million, three hundred eight thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •