Base | Representation |
---|---|
bin | 10000010011011110111… |
… | …001111111010010000011 |
3 | 10222010000210001022111022 |
4 | 100103132321333102003 |
5 | 121324120344142243 |
6 | 2214415145540055 |
7 | 143643221255603 |
oct | 20233671772203 |
9 | 3863023038438 |
10 | 1120431240323 |
11 | 3a219925327a |
12 | 1611921a462b |
13 | 8186b911ba5 |
14 | 3c32cb66c03 |
15 | 1e229501b68 |
hex | 104dee7f483 |
1120431240323 has 12 divisors (see below), whose sum is σ = 1192640101032. Its totient is φ = 1052375681280.
The previous prime is 1120431240259. The next prime is 1120431240349. The reversal of 1120431240323 is 3230421340211.
It is not a de Polignac number, because 1120431240323 - 26 = 1120431240259 is a prime.
It is a super-2 number, since 2×11204312403232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1120431240292 and 1120431240301.
It is not an unprimeable number, because it can be changed into a prime (1120431240623) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3806090 + ... + 4089887.
It is an arithmetic number, because the mean of its divisors is an integer number (99386675086).
Almost surely, 21120431240323 is an apocalyptic number.
1120431240323 is a deficient number, since it is larger than the sum of its proper divisors (72208860709).
1120431240323 is an equidigital number, since it uses as much as digits as its factorization.
1120431240323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7896502 (or 7896485 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 1120431240323 its reverse (3230421340211), we get a palindrome (4350852580534).
The spelling of 1120431240323 in words is "one trillion, one hundred twenty billion, four hundred thirty-one million, two hundred forty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •