Base | Representation |
---|---|
bin | 100001101011111… |
… | …1010000001000111 |
3 | 2220202221020120010 |
4 | 1003113322001013 |
5 | 4303331343143 |
6 | 304055041303 |
7 | 40003510062 |
oct | 10327720107 |
9 | 2822836503 |
10 | 1130340423 |
11 | 530058543 |
12 | 276670233 |
13 | 1502448b4 |
14 | aa1998d9 |
15 | 6937aa33 |
hex | 435fa047 |
1130340423 has 4 divisors (see below), whose sum is σ = 1507120568. Its totient is φ = 753560280.
The previous prime is 1130340401. The next prime is 1130340433. The reversal of 1130340423 is 3240430311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3240430311 = 3 ⋅1080143437.
It is not a de Polignac number, because 1130340423 - 224 = 1113563207 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 1130340423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130340433) 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, 188390068 + ... + 188390073.
It is an arithmetic number, because the mean of its divisors is an integer number (376780142).
Almost surely, 21130340423 is an apocalyptic number.
1130340423 is a deficient number, since it is larger than the sum of its proper divisors (376780145).
1130340423 is an equidigital number, since it uses as much as digits as its factorization.
1130340423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376780144.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 1130340423 is about 33620.5357333877. The cubic root of 1130340423 is about 1041.6850220666.
Adding to 1130340423 its reverse (3240430311), we get a palindrome (4370770734).
The spelling of 1130340423 in words is "one billion, one hundred thirty million, three hundred forty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •