Base | Representation |
---|---|
bin | 10000100100110001100… |
… | …000100010111010100100 |
3 | 11000212221122201000110000 |
4 | 100210301200202322210 |
5 | 122130131204324034 |
6 | 2231125321301300 |
7 | 145201256215242 |
oct | 20446140427244 |
9 | 4025848630400 |
10 | 1138996948644 |
11 | 3aa0560a1775 |
12 | 1648b3934830 |
13 | 8353a0c2809 |
14 | 3d1b0771792 |
15 | 1e9643a2599 |
hex | 10931822ea4 |
1138996948644 has 135 divisors (see below), whose sum is σ = 3002426219793. Its totient is φ = 376521566400.
The previous prime is 1138996948543. The next prime is 1138996948667. The reversal of 1138996948644 is 4468496998311.
The square root of 1138996948644 is 1067238.
It is a perfect power (a square), and thus also a powerful number.
1138996948644 is a `hidden beast` number, since 1 + 1 + 3 + 89 + 9 + 69 + 486 + 4 + 4 = 666.
It can be written as a sum of positive squares in only one way, i.e., 769721966244 + 369274982400 = 877338^2 + 607680^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 4053369784 + ... + 4053370064.
Almost surely, 21138996948644 is an apocalyptic number.
1138996948644 is the 1067238-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1138996948644
1138996948644 is an abundant number, since it is smaller than the sum of its proper divisors (1863429271149).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1138996948644 is an frugal number, since it uses more digits than its factorization.
1138996948644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000 (or 497 counting only the distinct ones).
The product of its digits is 322486272, while the sum is 72.
The spelling of 1138996948644 in words is "one trillion, one hundred thirty-eight billion, nine hundred ninety-six million, nine hundred forty-eight thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •