Base | Representation |
---|---|
bin | 10000101110001110110… |
… | …100100011111011001100 |
3 | 11001212011101222222022000 |
4 | 100232032310203323030 |
5 | 122311431004130330 |
6 | 2235525140152300 |
7 | 146011032221223 |
oct | 20561664437314 |
9 | 4055141888260 |
10 | 1149152411340 |
11 | 40339763a14a |
12 | 166868998690 |
13 | 8449807243b |
14 | 3d895401cba |
15 | 1ed5ac1d560 |
hex | 10b8ed23ecc |
1149152411340 has 96 divisors (see below), whose sum is σ = 3763306176000. Its totient is φ = 290312185536.
The previous prime is 1149152411311. The next prime is 1149152411387. The reversal of 1149152411340 is 431142519411.
1149152411340 is a `hidden beast` number, since 1 + 1 + 4 + 91 + 524 + 1 + 1 + 3 + 40 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 1149152411295 and 1149152411304.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 55991320 + ... + 56011839.
It is an arithmetic number, because the mean of its divisors is an integer number (39201106000).
Almost surely, 21149152411340 is an apocalyptic number.
1149152411340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1149152411340 is an abundant number, since it is smaller than the sum of its proper divisors (2614153764660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1149152411340 is a wasteful number, since it uses less digits than its factorization.
1149152411340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112003196 (or 112003188 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The spelling of 1149152411340 in words is "one trillion, one hundred forty-nine billion, one hundred fifty-two million, four hundred eleven thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •