Base | Representation |
---|---|
bin | 111100011001001… |
… | …011001001011110 |
3 | 2121121120112022100 |
4 | 330121023021132 |
5 | 4033341412342 |
6 | 244313025530 |
7 | 34052221542 |
oct | 7431131136 |
9 | 2547515270 |
10 | 1013232222 |
11 | 47aa41402 |
12 | 2433b52a6 |
13 | 131bc0cc2 |
14 | 987d3a22 |
15 | 5de46e4c |
hex | 3c64b25e |
1013232222 has 24 divisors (see below), whose sum is σ = 2203694064. Its totient is φ = 336458304.
The previous prime is 1013232173. The next prime is 1013232229. The reversal of 1013232222 is 2222323101.
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 = 1013232195 and 1013232204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013232229) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 102283 + ... + 111750.
It is an arithmetic number, because the mean of its divisors is an integer number (91820586).
Almost surely, 21013232222 is an apocalyptic number.
1013232222 is an abundant number, since it is smaller than the sum of its proper divisors (1190461842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013232222 is a wasteful number, since it uses less digits than its factorization.
1013232222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 214304 (or 214301 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 1013232222 is about 31831.3088326572. The cubic root of 1013232222 is about 1004.3914277995.
Adding to 1013232222 its reverse (2222323101), we get a palindrome (3235555323).
It can be divided in two parts, 101 and 3232222, that added together give a palindrome (3232323).
The spelling of 1013232222 in words is "one billion, thirteen million, two hundred thirty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •