Base | Representation |
---|---|
bin | 1001010100000111011100… |
… | …0110000100000110010110 |
3 | 1100021001022211210111000200 |
4 | 2111001313012010012112 |
5 | 2320242434212041042 |
6 | 33440424204321330 |
7 | 2104621325435055 |
oct | 225016706040626 |
9 | 40231284714020 |
10 | 10241200112022 |
11 | 32992a5526180 |
12 | 1194991243246 |
13 | 5939830603b9 |
14 | 275968d3a39c |
15 | 12b5e540cc4c |
hex | 95077184196 |
10241200112022 has 24 divisors (see below), whose sum is σ = 24206472992520. Its totient is φ = 3103393973280.
The previous prime is 10241200111997. The next prime is 10241200112053. The reversal of 10241200112022 is 22021100214201.
10241200112022 is a `hidden beast` number, since 10 + 241 + 200 + 11 + 202 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 10241200111986 and 10241200112004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25861616247 + ... + 25861616642.
It is an arithmetic number, because the mean of its divisors is an integer number (1008603041355).
Almost surely, 210241200112022 is an apocalyptic number.
10241200112022 is an abundant number, since it is smaller than the sum of its proper divisors (13965272880498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10241200112022 is a wasteful number, since it uses less digits than its factorization.
10241200112022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51723232908 (or 51723232905 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 10241200112022 its reverse (22021100214201), we get a palindrome (32262300326223).
The spelling of 10241200112022 in words is "ten trillion, two hundred forty-one billion, two hundred million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •