Base | Representation |
---|---|
bin | 10000011101110000011… |
… | …011100011001011111001 |
3 | 11000011111120121221211121 |
4 | 100131300123203023321 |
5 | 122014213420402144 |
6 | 2223441535425241 |
7 | 144513462000436 |
oct | 20356033431371 |
9 | 4004446557747 |
10 | 1131462669049 |
11 | 3a693a1a7a19 |
12 | 163350685221 |
13 | 829091c18cb |
14 | 3ca97c98b8d |
15 | 1e672bed384 |
hex | 107706e32f9 |
1131462669049 has 8 divisors (see below), whose sum is σ = 1134204422400. Its totient is φ = 1128721902336.
The previous prime is 1131462669019. The next prime is 1131462669079. The reversal of 1131462669049 is 9409662641311.
It is an interprime number because it is at equal distance from previous prime (1131462669019) and next prime (1131462669079).
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 1131462669049 - 227 = 1131328451321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1131462668987 and 1131462669005.
It is not an unprimeable number, because it can be changed into a prime (1131462669019) 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, 2076132 + ... + 2563834.
It is an arithmetic number, because the mean of its divisors is an integer number (141775552800).
Almost surely, 21131462669049 is an apocalyptic number.
It is an amenable number.
1131462669049 is a deficient number, since it is larger than the sum of its proper divisors (2741753351).
1131462669049 is an equidigital number, since it uses as much as digits as its factorization.
1131462669049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493319.
The product of its (nonzero) digits is 1679616, while the sum is 52.
The spelling of 1131462669049 in words is "one trillion, one hundred thirty-one billion, four hundred sixty-two million, six hundred sixty-nine thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •