Base | Representation |
---|---|
bin | 11101110010011110100… |
… | …10101101011110110101 |
3 | 10121211220202000101002121 |
4 | 32321033102231132311 |
5 | 113232143311141042 |
6 | 2102112050035541 |
7 | 133643042612101 |
oct | 16711722553665 |
9 | 3554822011077 |
10 | 1023532521397 |
11 | 365094474591 |
12 | 14644ab78bb1 |
13 | 75698788609 |
14 | 37779954901 |
15 | 1b9576b5367 |
hex | ee4f4ad7b5 |
1023532521397 has 4 divisors (see below), whose sum is σ = 1025812104300. Its totient is φ = 1021252938496.
The previous prime is 1023532521373. The next prime is 1023532521413. The reversal of 1023532521397 is 7931252353201.
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 772164655441 + 251367865956 = 878729^2 + 501366^2 .
It is a cyclic number.
It is not a de Polignac number, because 1023532521397 - 27 = 1023532521269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023532521367) 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, 1139790778 + ... + 1139791675.
It is an arithmetic number, because the mean of its divisors is an integer number (256453026075).
Almost surely, 21023532521397 is an apocalyptic number.
It is an amenable number.
1023532521397 is a deficient number, since it is larger than the sum of its proper divisors (2279582903).
1023532521397 is an equidigital number, since it uses as much as digits as its factorization.
1023532521397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2279582902.
The product of its (nonzero) digits is 340200, while the sum is 43.
Adding to 1023532521397 its reverse (7931252353201), we get a palindrome (8954784874598).
The spelling of 1023532521397 in words is "one trillion, twenty-three billion, five hundred thirty-two million, five hundred twenty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •