Base | Representation |
---|---|
bin | 1001011101011000001001… |
… | …0001011110000011000110 |
3 | 1100211020222220000102102220 |
4 | 2113112002101132003012 |
5 | 2330344304132104342 |
6 | 34041455454113210 |
7 | 2122253110426560 |
oct | 227260221360306 |
9 | 40736886012386 |
10 | 10400301441222 |
11 | 334a81a0346a0 |
12 | 11bb793aab806 |
13 | 5a598a07a644 |
14 | 27d53d35c330 |
15 | 1308080325ec |
hex | 9758245e0c6 |
10400301441222 has 64 divisors (see below), whose sum is σ = 25933569984000. Its totient is φ = 2701340455680.
The previous prime is 10400301441113. The next prime is 10400301441227. The reversal of 10400301441222 is 22214410300401.
It is a junction number, because it is equal to n+sod(n) for n = 10400301441192 and 10400301441201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10400301441227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 58284154 + ... + 58462322.
It is an arithmetic number, because the mean of its divisors is an integer number (405212031000).
Almost surely, 210400301441222 is an apocalyptic number.
10400301441222 is an abundant number, since it is smaller than the sum of its proper divisors (15533268542778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10400301441222 is a wasteful number, since it uses less digits than its factorization.
10400301441222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304541.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 10400301441222 its reverse (22214410300401), we get a palindrome (32614711741623).
The spelling of 10400301441222 in words is "ten trillion, four hundred billion, three hundred one million, four hundred forty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •