Base | Representation |
---|---|
bin | 10011011001001110… |
… | …00011010111011010 |
3 | 222212122020001120200 |
4 | 21230213003113122 |
5 | 132311000030242 |
6 | 4441103403030 |
7 | 516010325454 |
oct | 115447032732 |
9 | 28778201520 |
10 | 10412111322 |
11 | 4463402388 |
12 | 2026bb3476 |
13 | c9c1ac622 |
14 | 70ab9b2d4 |
15 | 40e16504c |
hex | 26c9c35da |
10412111322 has 12 divisors (see below), whose sum is σ = 22559574570. Its totient is φ = 3470703768.
The previous prime is 10412111299. The next prime is 10412111327. The reversal of 10412111322 is 22311121401.
It can be written as a sum of positive squares in only one way, i.e., 8233929081 + 2178182241 = 90741^2 + 46671^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 578450629 = 10412111322 / (1 + 0 + 4 + 1 + 2 + 1 + 1 + 1 + 3 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 10412111295 and 10412111304.
It is not an unprimeable number, because it can be changed into a prime (10412111327) 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, 289225297 + ... + 289225332.
Almost surely, 210412111322 is an apocalyptic number.
10412111322 is an abundant number, since it is smaller than the sum of its proper divisors (12147463248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10412111322 is a wasteful number, since it uses less digits than its factorization.
10412111322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 578450637 (or 578450634 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 10412111322 its reverse (22311121401), we get a palindrome (32723232723).
The spelling of 10412111322 in words is "ten billion, four hundred twelve million, one hundred eleven thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •