Base | Representation |
---|---|
bin | 1011010000011101010001… |
… | …0001000111101111010000 |
3 | 1121211021010122022211120120 |
4 | 2310013110101013233100 |
5 | 3110242314140201322 |
6 | 42154025344110240 |
7 | 2415143366265330 |
oct | 264072421075720 |
9 | 47737118284516 |
10 | 12377362037712 |
11 | 3a42234214061 |
12 | 147a995605380 |
13 | 6ba245c7b169 |
14 | 30b0d33b50c0 |
15 | 166e6c1bea5c |
hex | b41d4447bd0 |
12377362037712 has 640 divisors, whose sum is σ = 40745582592000. Its totient is φ = 3157804984320.
The previous prime is 12377362037683. The next prime is 12377362037749. The reversal of 12377362037712 is 21773026377321.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 3310338339 + ... + 3310342077.
It is an arithmetic number, because the mean of its divisors is an integer number (63664972800).
Almost surely, 212377362037712 is an apocalyptic number.
12377362037712 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12377362037712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20372791296000).
12377362037712 is an abundant number, since it is smaller than the sum of its proper divisors (28368220554288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12377362037712 is a wasteful number, since it uses less digits than its factorization.
12377362037712 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4239 (or 4233 counting only the distinct ones).
The product of its (nonzero) digits is 3111696, while the sum is 51.
The spelling of 12377362037712 in words is "twelve trillion, three hundred seventy-seven billion, three hundred sixty-two million, thirty-seven thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •