Base | Representation |
---|---|
bin | 100010001111100… |
… | …1111110111011010 |
3 | 2222002010101111020 |
4 | 1010133033313122 |
5 | 4323123322023 |
6 | 310003543310 |
7 | 40321461036 |
oct | 10437176732 |
9 | 2862111436 |
10 | 1149042138 |
11 | 53a671402 |
12 | 28098ab36 |
13 | 1540920ba |
14 | ac8671c6 |
15 | 6ad21de3 |
hex | 447cfdda |
1149042138 has 64 divisors (see below), whose sum is σ = 2623985280. Its totient is φ = 333158400.
The previous prime is 1149042133. The next prime is 1149042151. The reversal of 1149042138 is 8312409411.
It is a happy number.
It is a super-2 number, since 2×11490421382 = 2640595669799222088, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1149042099 and 1149042108.
It is not an unprimeable number, because it can be changed into a prime (1149042133) 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 31 ways as a sum of consecutive naturals, for example, 72228 + ... + 86688.
It is an arithmetic number, because the mean of its divisors is an integer number (40999770).
Almost surely, 21149042138 is an apocalyptic number.
1149042138 is an abundant number, since it is smaller than the sum of its proper divisors (1474943142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1149042138 is a wasteful number, since it uses less digits than its factorization.
1149042138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14543.
The product of its (nonzero) digits is 6912, while the sum is 33.
The square root of 1149042138 is about 33897.5240688756. The cubic root of 1149042138 is about 1047.3985906313.
It can be divided in two parts, 11490 and 42138, that added together give a triangular number (53628 = T327).
The spelling of 1149042138 in words is "one billion, one hundred forty-nine million, forty-two thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •