Base | Representation |
---|---|
bin | 111100111111101… |
… | …100101100110010 |
3 | 2122022120121101200 |
4 | 330333230230302 |
5 | 4043433043442 |
6 | 245313312030 |
7 | 34234112442 |
oct | 7477545462 |
9 | 2568517350 |
10 | 1023331122 |
11 | 485709900 |
12 | 246865616 |
13 | 134018898 |
14 | 99ca2122 |
15 | 5ec8e34c |
hex | 3cfecb32 |
1023331122 has 36 divisors (see below), whose sum is σ = 2437111950. Its totient is φ = 310099680.
The previous prime is 1023331093. The next prime is 1023331123. The reversal of 1023331122 is 2211333201.
It can be written as a sum of positive squares in only one way, i.e., 837581481 + 185749641 = 28941^2 + 13629^2 .
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 = 1023331095 and 1023331104.
It is not an unprimeable number, because it can be changed into a prime (1023331123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 232747 + ... + 237102.
Almost surely, 21023331122 is an apocalyptic number.
1023331122 is an abundant number, since it is smaller than the sum of its proper divisors (1413780828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023331122 is a wasteful number, since it uses less digits than its factorization.
1023331122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469879 (or 469865 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 1023331122 is about 31989.5470740053. The cubic root of 1023331122 is about 1007.7173302726.
Adding to 1023331122 its reverse (2211333201), we get a palindrome (3234664323).
The spelling of 1023331122 in words is "one billion, twenty-three million, three hundred thirty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •