Base | Representation |
---|---|
bin | 11101110010011100000… |
… | …11110111000101100001 |
3 | 10121211212022010020010201 |
4 | 32321032003313011201 |
5 | 113232123013220421 |
6 | 2102110031025201 |
7 | 133642402122436 |
oct | 16711603670541 |
9 | 3554768106121 |
10 | 1023511851361 |
11 | 36508383690a |
12 | 14644406b201 |
13 | 756943cc21c |
14 | 37776cd3b8d |
15 | 1b955980b91 |
hex | ee4e0f7161 |
1023511851361 has 4 divisors (see below), whose sum is σ = 1024061832724. Its totient is φ = 1022961870000.
The previous prime is 1023511851359. The next prime is 1023511851377. The reversal of 1023511851361 is 1631581153201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 210079222336 + 813432629025 = 458344^2 + 901905^2 .
It is a cyclic number.
It is not a de Polignac number, because 1023511851361 - 21 = 1023511851359 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1023511851361.
It is not an unprimeable number, because it can be changed into a prime (1023511851311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 274987890 + ... + 274991611.
It is an arithmetic number, because the mean of its divisors is an integer number (256015458181).
Almost surely, 21023511851361 is an apocalyptic number.
It is an amenable number.
1023511851361 is a deficient number, since it is larger than the sum of its proper divisors (549981363).
1023511851361 is an equidigital number, since it uses as much as digits as its factorization.
1023511851361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 549981362.
The product of its (nonzero) digits is 21600, while the sum is 37.
The spelling of 1023511851361 in words is "one trillion, twenty-three billion, five hundred eleven million, eight hundred fifty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •