Base | Representation |
---|---|
bin | 1001011111110100010001… |
… | …1001110001011010011100 |
3 | 1100222021011210012110021002 |
4 | 2113331010121301122130 |
5 | 2332041123023301020 |
6 | 34113030402325432 |
7 | 2125265526611231 |
oct | 227750431613234 |
9 | 40867153173232 |
10 | 10442213103260 |
11 | 3366577083714 |
12 | 1207930059878 |
13 | 5a99091b7973 |
14 | 28159778b788 |
15 | 13195c77c975 |
hex | 97f4467169c |
10442213103260 has 24 divisors (see below), whose sum is σ = 21928721655456. Its totient is φ = 4176871119680.
The previous prime is 10442213103227. The next prime is 10442213103271. The reversal of 10442213103260 is 6230131224401.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6820745 + ... + 8210175.
It is an arithmetic number, because the mean of its divisors is an integer number (913696735644).
Almost surely, 210442213103260 is an apocalyptic number.
10442213103260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10442213103260 is an abundant number, since it is smaller than the sum of its proper divisors (11486508552196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10442213103260 is a wasteful number, since it uses less digits than its factorization.
10442213103260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1765213 (or 1765211 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 10442213103260 its reverse (6230131224401), we get a palindrome (16672344327661).
The spelling of 10442213103260 in words is "ten trillion, four hundred forty-two billion, two hundred thirteen million, one hundred three thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •