Base | Representation |
---|---|
bin | 100111101011000… |
… | …1111010110101010 |
3 | 10102202221111102100 |
4 | 1033112033112222 |
5 | 10211243330442 |
6 | 340032514230 |
7 | 44663161245 |
oct | 11726172652 |
9 | 3382844370 |
10 | 1331230122 |
11 | 623498992 |
12 | 3119ab976 |
13 | 182a50b41 |
14 | c8b3025c |
15 | 7bd0d84c |
hex | 4f58f5aa |
1331230122 has 48 divisors (see below), whose sum is σ = 2920027968. Its totient is φ = 438285120.
The previous prime is 1331230073. The next prime is 1331230127. The reversal of 1331230122 is 2210321331.
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 = 1331230095 and 1331230104.
It is not an unprimeable number, because it can be changed into a prime (1331230127) 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, 548203 + ... + 550625.
It is an arithmetic number, because the mean of its divisors is an integer number (60833916).
Almost surely, 21331230122 is an apocalyptic number.
1331230122 is an abundant number, since it is smaller than the sum of its proper divisors (1588797846).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1331230122 is a wasteful number, since it uses less digits than its factorization.
1331230122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2795 (or 2792 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 1331230122 is about 36486.0263936757. The cubic root of 1331230122 is about 1100.0633908372.
Adding to 1331230122 its reverse (2210321331), we get a palindrome (3541551453).
It can be divided in two parts, 13312 and 30122, that added together give a palindrome (43434).
The spelling of 1331230122 in words is "one billion, three hundred thirty-one million, two hundred thirty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •