Base | Representation |
---|---|
bin | 111100010000101… |
… | …111011000110001 |
3 | 2121110102012120121 |
4 | 330100233120301 |
5 | 4032310140421 |
6 | 244153410241 |
7 | 34024353100 |
oct | 7420573061 |
9 | 2543365517 |
10 | 1011021361 |
11 | 479771349 |
12 | 242709981 |
13 | 1315c88bc |
14 | 983ba037 |
15 | 5db5bd41 |
hex | 3c42f631 |
1011021361 has 6 divisors (see below), whose sum is σ = 1176086130. Its totient is φ = 866589696.
The previous prime is 1011021359. The next prime is 1011021377. The reversal of 1011021361 is 1631201101.
1011021361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 597509136 + 413512225 = 24444^2 + 20335^2 .
It is not a de Polignac number, because 1011021361 - 21 = 1011021359 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1011021301) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 10316496 + ... + 10316593.
It is an arithmetic number, because the mean of its divisors is an integer number (196014355).
Almost surely, 21011021361 is an apocalyptic number.
It is an amenable number.
1011021361 is a deficient number, since it is larger than the sum of its proper divisors (165064769).
1011021361 is an equidigital number, since it uses as much as digits as its factorization.
1011021361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20633103 (or 20633096 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
The square root of 1011021361 is about 31796.5620940378. The cubic root of 1011021361 is about 1003.6603723268.
Adding to 1011021361 its reverse (1631201101), we get a palindrome (2642222462).
The spelling of 1011021361 in words is "one billion, eleven million, twenty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •