Base | Representation |
---|---|
bin | 1011011010100101000001… |
… | …0010111101001001111000 |
3 | 1122102212221121101001110112 |
4 | 2312221100102331021320 |
5 | 3121114420321212042 |
6 | 42405543310203452 |
7 | 2433540316122635 |
oct | 266512022751170 |
9 | 48385847331415 |
10 | 12551241585272 |
11 | 3aa9a51734785 |
12 | 14a86214b3588 |
13 | 7007668a1b00 |
14 | 3156aa3a918c |
15 | 16b7473ea982 |
hex | b6a504bd278 |
12551241585272 has 48 divisors (see below), whose sum is σ = 25582261901040. Its totient is φ = 5770340179968.
The previous prime is 12551241585271. The next prime is 12551241585293. The reversal of 12551241585272 is 27258514215521.
It is a super-2 number, since 2×125512415852722 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12551241585272.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12551241585271) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17713748 + ... + 18408675.
It is an arithmetic number, because the mean of its divisors is an integer number (532963789605).
Almost surely, 212551241585272 is an apocalyptic number.
It is an amenable number.
12551241585272 is an abundant number, since it is smaller than the sum of its proper divisors (13031020315768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12551241585272 is a wasteful number, since it uses less digits than its factorization.
12551241585272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36122712 (or 36122695 counting only the distinct ones).
The product of its digits is 2240000, while the sum is 50.
The spelling of 12551241585272 in words is "twelve trillion, five hundred fifty-one billion, two hundred forty-one million, five hundred eighty-five thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •