Base | Representation |
---|---|
bin | 10000101111100110111… |
… | …110100011000001111110 |
3 | 11001222222111000121102100 |
4 | 100233212332203001332 |
5 | 122322443121033001 |
6 | 2240332012405530 |
7 | 146062501505652 |
oct | 20574676430176 |
9 | 4058874017370 |
10 | 1150631424126 |
11 | 403a86495368 |
12 | 1670001768a6 |
13 | 846725c6b32 |
14 | 3d995a00a62 |
15 | 1ede59be586 |
hex | 10be6fa307e |
1150631424126 has 24 divisors (see below), whose sum is σ = 2560414071384. Its totient is φ = 373177758960.
The previous prime is 1150631424023. The next prime is 1150631424127. The reversal of 1150631424126 is 6214241360511.
1150631424126 is a `hidden beast` number, since 1 + 1 + 5 + 0 + 631 + 4 + 2 + 4 + 12 + 6 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1150631424127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 863836740 + ... + 863838071.
It is an arithmetic number, because the mean of its divisors is an integer number (106683919641).
Almost surely, 21150631424126 is an apocalyptic number.
1150631424126 is an abundant number, since it is smaller than the sum of its proper divisors (1409782647258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1150631424126 is a wasteful number, since it uses less digits than its factorization.
1150631424126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1727674856 (or 1727674853 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
Adding to 1150631424126 its reverse (6214241360511), we get a palindrome (7364872784637).
The spelling of 1150631424126 in words is "one trillion, one hundred fifty billion, six hundred thirty-one million, four hundred twenty-four thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •