Base | Representation |
---|---|
bin | 1001010010111000111011… |
… | …0101101110100111000000 |
3 | 1100012000220222201002112211 |
4 | 2110232032311232213000 |
5 | 2314421303123141100 |
6 | 33423020542431504 |
7 | 2103244122434323 |
oct | 224561665564700 |
9 | 40160828632484 |
10 | 10220123646400 |
11 | 329036a3a6648 |
12 | 119088a892594 |
13 | 5919a4654b75 |
14 | 274929ac07ba |
15 | 12acaee091ba |
hex | 94b8ed6e9c0 |
10220123646400 has 42 divisors (see below), whose sum is σ = 25147891751360. Its totient is φ = 4088049457920.
The previous prime is 10220123646377. The next prime is 10220123646401. The reversal of 10220123646400 is 464632102201.
10220123646400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220123646401) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3193787040 + ... + 3193790239.
Almost surely, 210220123646400 is an apocalyptic number.
10220123646400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10220123646400 is an abundant number, since it is smaller than the sum of its proper divisors (14927768104960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10220123646400 is an equidigital number, since it uses as much as digits as its factorization.
10220123646400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6387577301 (or 6387577286 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 10220123646400 its reverse (464632102201), we get a palindrome (10684755748601).
The spelling of 10220123646400 in words is "ten trillion, two hundred twenty billion, one hundred twenty-three million, six hundred forty-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •