Base | Representation |
---|---|
bin | 10000101111100000001… |
… | …100000100111011011011 |
3 | 11001222200112201012111122 |
4 | 100233200030010323123 |
5 | 122322224441432311 |
6 | 2240312423315455 |
7 | 146056616436041 |
oct | 20574014047333 |
9 | 4058615635448 |
10 | 1150517530331 |
11 | 403a28174264 |
12 | 166b89babb8b |
13 | 84654b2a360 |
14 | 3d984834391 |
15 | 1edda9c30db |
hex | 10be0304edb |
1150517530331 has 8 divisors (see below), whose sum is σ = 1239061620720. Its totient is φ = 1061979545952.
The previous prime is 1150517530303. The next prime is 1150517530361. The reversal of 1150517530331 is 1330357150511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1150517530331 - 210 = 1150517529307 is a prime.
It is a super-2 number, since 2×11505175303312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1150517530291 and 1150517530300.
It is not an unprimeable number, because it can be changed into a prime (1150517530361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1131365 + ... + 1892358.
It is an arithmetic number, because the mean of its divisors is an integer number (154882702590).
Almost surely, 21150517530331 is an apocalyptic number.
1150517530331 is a deficient number, since it is larger than the sum of its proper divisors (88544090389).
1150517530331 is a wasteful number, since it uses less digits than its factorization.
1150517530331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3053005.
The product of its (nonzero) digits is 23625, while the sum is 35.
The spelling of 1150517530331 in words is "one trillion, one hundred fifty billion, five hundred seventeen million, five hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •