Base | Representation |
---|---|
bin | 10000101111011001111… |
… | …110101110100100000000 |
3 | 11001222102021201012000221 |
4 | 100233121332232210000 |
5 | 122322021310230202 |
6 | 2240254222552424 |
7 | 146054213165341 |
oct | 20573176564400 |
9 | 4058367635027 |
10 | 1150413367552 |
11 | 40398439a219 |
12 | 166b5b138714 |
13 | 84639389b87 |
14 | 3d974a7c0c8 |
15 | 1edd179a037 |
hex | 10bd9fae900 |
1150413367552 has 36 divisors (see below), whose sum is σ = 2296847683116. Its totient is φ = 575077744640.
The previous prime is 1150413367531. The next prime is 1150413367559. The reversal of 1150413367552 is 2557633140511.
It can be written as a sum of positive squares in 2 ways, for example, as 547268530176 + 603144837376 = 739776^2 + 776624^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1150413367499 and 1150413367508.
It is not an unprimeable number, because it can be changed into a prime (1150413367559) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 645708 + ... + 1648564.
It is an arithmetic number, because the mean of its divisors is an integer number (63801324531).
Almost surely, 21150413367552 is an apocalyptic number.
It is an amenable number.
1150413367552 is a deficient number, since it is larger than the sum of its proper divisors (1146434315564).
1150413367552 is an equidigital number, since it uses as much as digits as its factorization.
1150413367552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1007354 (or 1007340 counting only the distinct ones).
The product of its (nonzero) digits is 378000, while the sum is 43.
The spelling of 1150413367552 in words is "one trillion, one hundred fifty billion, four hundred thirteen million, three hundred sixty-seven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •