Base | Representation |
---|---|
bin | 111110000101000010001… |
… | …010110000011011101000 |
3 | 120002211022202102000001012 |
4 | 332011002022300123220 |
5 | 1024343243214003000 |
6 | 13023440144043052 |
7 | 620131525102325 |
oct | 76050212603350 |
9 | 16084282360035 |
10 | 4266012641000 |
11 | 13a5229a15020 |
12 | 58a947003488 |
13 | 24c38b448516 |
14 | 10a694653b4c |
15 | 75e7e965735 |
hex | 3e1422b06e8 |
4266012641000 has 256 divisors, whose sum is σ = 11431839744000. Its totient is φ = 1475784480000.
The previous prime is 4266012640993. The next prime is 4266012641053. The reversal of 4266012641000 is 1462106624.
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, 20012981 + ... + 20225019.
It is an arithmetic number, because the mean of its divisors is an integer number (44655624000).
Almost surely, 24266012641000 is an apocalyptic number.
4266012641000 is a gapful number since it is divisible by the number (40) 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 4266012641000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5715919872000).
4266012641000 is an abundant number, since it is smaller than the sum of its proper divisors (7165827103000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4266012641000 is a wasteful number, since it uses less digits than its factorization.
4266012641000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212161 (or 212147 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 4266012641000 its reverse (1462106624), we get a palindrome (4267474747624).
The spelling of 4266012641000 in words is "four trillion, two hundred sixty-six billion, twelve million, six hundred forty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •