Base | Representation |
---|---|
bin | 10000101111001111000… |
… | …011101101011101111101 |
3 | 11001221221111220110201000 |
4 | 100233033003231131331 |
5 | 122321132402440123 |
6 | 2240224115240513 |
7 | 146046526511646 |
oct | 20571703553575 |
9 | 4057844813630 |
10 | 1150230124413 |
11 | 40389aa11a07 |
12 | 166b098a9139 |
13 | 8460a41ba96 |
14 | 3d9585bc6cd |
15 | 1edc0650b43 |
hex | 10bcf0ed77d |
1150230124413 has 32 divisors (see below), whose sum is σ = 1710617356800. Its totient is φ = 763863307200.
The previous prime is 1150230124369. The next prime is 1150230124427. The reversal of 1150230124413 is 3144210320511.
1150230124413 is a `hidden beast` number, since 1 + 1 + 5 + 0 + 230 + 12 + 4 + 413 = 666.
It is not a de Polignac number, because 1150230124413 - 28 = 1150230124157 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1150230124313) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68339683 + ... + 68356511.
It is an arithmetic number, because the mean of its divisors is an integer number (53456792400).
Almost surely, 21150230124413 is an apocalyptic number.
It is an amenable number.
1150230124413 is a deficient number, since it is larger than the sum of its proper divisors (560387232387).
1150230124413 is a wasteful number, since it uses less digits than its factorization.
1150230124413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26450 (or 26444 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 1150230124413 its reverse (3144210320511), we get a palindrome (4294440444924).
The spelling of 1150230124413 in words is "one trillion, one hundred fifty billion, two hundred thirty million, one hundred twenty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •