Base | Representation |
---|---|
bin | 10000101010011011101… |
… | …111100001001110010101 |
3 | 11001110122012011200211002 |
4 | 100222123233201032111 |
5 | 122230103000213234 |
6 | 2234012334353045 |
7 | 145505002220234 |
oct | 20523357411625 |
9 | 4043565150732 |
10 | 1145074226069 |
11 | 4016946041a4 |
12 | 165b0b05b785 |
13 | 83c981a7667 |
14 | 3d5c9938b1b |
15 | 1ebbcba227e |
hex | 10a9bbe1395 |
1145074226069 has 8 divisors (see below), whose sum is σ = 1145416324632. Its totient is φ = 1144732193280.
The previous prime is 1145074226063. The next prime is 1145074226083. The reversal of 1145074226069 is 9606224705411.
It can be written as a sum of positive squares in 4 ways, for example, as 854262093169 + 290812132900 = 924263^2 + 539270^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1145074226069 - 236 = 1076354749333 is a prime.
It is a super-2 number, since 2×11450742260692 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1145074226063) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71950457 + ... + 71966369.
It is an arithmetic number, because the mean of its divisors is an integer number (143177040579).
Almost surely, 21145074226069 is an apocalyptic number.
It is an amenable number.
1145074226069 is a deficient number, since it is larger than the sum of its proper divisors (342098563).
1145074226069 is an equidigital number, since it uses as much as digits as its factorization.
1145074226069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32887.
The product of its (nonzero) digits is 725760, while the sum is 47.
The spelling of 1145074226069 in words is "one trillion, one hundred forty-five billion, seventy-four million, two hundred twenty-six thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •