Base | Representation |
---|---|
bin | 10000100111100101001… |
… | …000011101001000001101 |
3 | 11001011201200021221010220 |
4 | 100213211020131020031 |
5 | 122202314144013430 |
6 | 2232344333021553 |
7 | 145336041234513 |
oct | 20474510351015 |
9 | 4034650257126 |
10 | 1142010532365 |
11 | 40036219a82a |
12 | 1653b50248b9 |
13 | 838ca551b51 |
14 | 3d3b8ab24b3 |
15 | 1ea8dc2b110 |
hex | 109e521d20d |
1142010532365 has 8 divisors (see below), whose sum is σ = 1827216851808. Its totient is φ = 609072283920.
The previous prime is 1142010532349. The next prime is 1142010532379. The reversal of 1142010532365 is 5632350102411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1142010532365 - 24 = 1142010532349 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38067017731 + ... + 38067017760.
It is an arithmetic number, because the mean of its divisors is an integer number (228402106476).
Almost surely, 21142010532365 is an apocalyptic number.
1142010532365 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1142010532365 is a deficient number, since it is larger than the sum of its proper divisors (685206319443).
1142010532365 is an equidigital number, since it uses as much as digits as its factorization.
1142010532365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76134035499.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 1142010532365 its reverse (5632350102411), we get a palindrome (6774360634776).
The spelling of 1142010532365 in words is "one trillion, one hundred forty-two billion, ten million, five hundred thirty-two thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •