Base | Representation |
---|---|
bin | 1001010101100101010100… |
… | …1100101010011110010100 |
3 | 1100100110101011010102210202 |
4 | 2111121111030222132110 |
5 | 2321201042203024000 |
6 | 33500153011440032 |
7 | 2106502664351405 |
oct | 225312514523624 |
9 | 40313334112722 |
10 | 10266401220500 |
11 | 32a8a57931a57 |
12 | 1199844bb6018 |
13 | 59616b14b5c9 |
14 | 276c79cb39ac |
15 | 12c0bcaa7dd5 |
hex | 9565532a794 |
10266401220500 has 48 divisors (see below), whose sum is σ = 22422597834000. Its totient is φ = 4106418076800.
The previous prime is 10266401220457. The next prime is 10266401220541. The reversal of 10266401220500 is 502210466201.
It can be written as a sum of positive squares in 8 ways, for example, as 4235084116624 + 6031317103876 = 2057932^2 + 2455874^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14713526 + ... + 15395474.
It is an arithmetic number, because the mean of its divisors is an integer number (467137454875).
Almost surely, 210266401220500 is an apocalyptic number.
10266401220500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10266401220500 is an abundant number, since it is smaller than the sum of its proper divisors (12156196613500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10266401220500 is a wasteful number, since it uses less digits than its factorization.
10266401220500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712077 (or 712065 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 10266401220500 its reverse (502210466201), we get a palindrome (10768611686701).
The spelling of 10266401220500 in words is "ten trillion, two hundred sixty-six billion, four hundred one million, two hundred twenty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •