Base | Representation |
---|---|
bin | 10010011011001010011… |
… | …010000000100000110100 |
3 | 11111001001211000002112010 |
4 | 102123022122000200310 |
5 | 131221001221404000 |
6 | 2405351252124220 |
7 | 160321353064044 |
oct | 22331232004064 |
9 | 4431054002463 |
10 | 1266116200500 |
11 | 448a58651108 |
12 | 18546b906670 |
13 | 92518207338 |
14 | 453cd3d7724 |
15 | 22e0437ad50 |
hex | 126ca680834 |
1266116200500 has 192 divisors, whose sum is σ = 3725222731776. Its totient is φ = 334141200000.
The previous prime is 1266116200463. The next prime is 1266116200519. The reversal of 1266116200500 is 50026116621.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 61371187 + ... + 61391813.
It is an arithmetic number, because the mean of its divisors is an integer number (19402201728).
Almost surely, 21266116200500 is an apocalyptic number.
1266116200500 is a gapful number since it is divisible by the number (10) 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 1266116200500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1862611365888).
1266116200500 is an abundant number, since it is smaller than the sum of its proper divisors (2459106531276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1266116200500 is a wasteful number, since it uses less digits than its factorization.
1266116200500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21071 (or 21059 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 30.
The spelling of 1266116200500 in words is "one trillion, two hundred sixty-six billion, one hundred sixteen million, two hundred thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •