Base | Representation |
---|---|
bin | 100010001001000… |
… | …1101010001011011 |
3 | 2221211200201012022 |
4 | 1010102031101123 |
5 | 4321234424033 |
6 | 305402405055 |
7 | 40250432423 |
oct | 10422152133 |
9 | 2854621168 |
10 | 1145623643 |
11 | 538746aaa |
12 | 27b80078b |
13 | 153466118 |
14 | ac217483 |
15 | 6a899098 |
hex | 4448d45b |
1145623643 has 4 divisors (see below), whose sum is σ = 1145749920. Its totient is φ = 1145497368.
The previous prime is 1145623607. The next prime is 1145623651. The reversal of 1145623643 is 3463265411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3463265411 = 23 ⋅150576757.
It is a cyclic number.
It is not a de Polignac number, because 1145623643 - 210 = 1145622619 is a prime.
It is a super-3 number, since 3×11456236433 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1145623043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48380 + ... + 68057.
It is an arithmetic number, because the mean of its divisors is an integer number (286437480).
Almost surely, 21145623643 is an apocalyptic number.
1145623643 is a deficient number, since it is larger than the sum of its proper divisors (126277).
1145623643 is an equidigital number, since it uses as much as digits as its factorization.
1145623643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126276.
The product of its digits is 51840, while the sum is 35.
The square root of 1145623643 is about 33847.0625461058. The cubic root of 1145623643 is about 1046.3588598287.
The spelling of 1145623643 in words is "one billion, one hundred forty-five million, six hundred twenty-three thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •