Base | Representation |
---|---|
bin | 10011011011011011… |
… | …01010011010001010 |
3 | 222220221001110112020 |
4 | 21231231222122022 |
5 | 132330214340242 |
6 | 4443004225310 |
7 | 516323550462 |
oct | 115555523212 |
9 | 28827043466 |
10 | 10430621322 |
11 | 44728a5200 |
12 | 203123b236 |
13 | ca2c907a4 |
14 | 70d418ba2 |
15 | 410abe6ec |
hex | 26db6a68a |
10430621322 has 48 divisors (see below), whose sum is σ = 22950480000. Its totient is φ = 3157989120.
The previous prime is 10430621317. The next prime is 10430621323. The reversal of 10430621322 is 22312603401.
It is a super-2 number, since 2×104306213222 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10430621292 and 10430621301.
It is not an unprimeable number, because it can be changed into a prime (10430621323) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 901023 + ... + 912525.
It is an arithmetic number, because the mean of its divisors is an integer number (478135000).
Almost surely, 210430621322 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10430621322, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11475240000).
10430621322 is an abundant number, since it is smaller than the sum of its proper divisors (12519858678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10430621322 is a wasteful number, since it uses less digits than its factorization.
10430621322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12779 (or 12768 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
The spelling of 10430621322 in words is "ten billion, four hundred thirty million, six hundred twenty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •