Base | Representation |
---|---|
bin | 10000011101011100001… |
… | …001001010010000010111 |
3 | 11000010121212011121210112 |
4 | 100131130021022100113 |
5 | 122013014302212043 |
6 | 2223344100313235 |
7 | 144502156642535 |
oct | 20353411122027 |
9 | 4003555147715 |
10 | 1131122304023 |
11 | 3a6785063708 |
12 | 1632766a281b |
13 | 8288383009a |
14 | 3ca649b9155 |
15 | 1e652db9518 |
hex | 1075c24a417 |
1131122304023 has 32 divisors (see below), whose sum is σ = 1231962177600. Its totient is φ = 1037959415808.
The previous prime is 1131122304001. The next prime is 1131122304077. The reversal of 1131122304023 is 3204032211311.
It is not a de Polignac number, because 1131122304023 - 238 = 856244397079 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1131122304023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131122354023) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 125272073 + ... + 125281101.
It is an arithmetic number, because the mean of its divisors is an integer number (38498818050).
Almost surely, 21131122304023 is an apocalyptic number.
1131122304023 is a deficient number, since it is larger than the sum of its proper divisors (100839873577).
1131122304023 is an frugal number, since it uses more digits than its factorization.
1131122304023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9716 (or 9682 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1131122304023 its reverse (3204032211311), we get a palindrome (4335154515334).
The spelling of 1131122304023 in words is "one trillion, one hundred thirty-one billion, one hundred twenty-two million, three hundred four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •