Base | Representation |
---|---|
bin | 11000011001111010… |
… | …00010101011001110 |
3 | 1020211010011020222000 |
4 | 30030331002223032 |
5 | 203313132331342 |
6 | 10004042133130 |
7 | 642454055634 |
oct | 141475025316 |
9 | 36733136860 |
10 | 13102230222 |
11 | 561395a544 |
12 | 2657ab11a6 |
13 | 130a616663 |
14 | 8c417b354 |
15 | 51a3e744c |
hex | 30cf42ace |
13102230222 has 16 divisors (see below), whose sum is σ = 29116067280. Its totient is φ = 4367410056.
The previous prime is 13102230203. The next prime is 13102230263. The reversal of 13102230222 is 22203220131.
13102230222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 = 13102230195 and 13102230204.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 121316893 + ... + 121317000.
It is an arithmetic number, because the mean of its divisors is an integer number (1819754205).
Almost surely, 213102230222 is an apocalyptic number.
13102230222 is an abundant number, since it is smaller than the sum of its proper divisors (16013837058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13102230222 is a wasteful number, since it uses less digits than its factorization.
13102230222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242633904 (or 242633898 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 13102230222 its reverse (22203220131), we get a palindrome (35305450353).
The spelling of 13102230222 in words is "thirteen billion, one hundred two million, two hundred thirty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •