Base | Representation |
---|---|
bin | 10111011111010010… |
… | …11100111000111100 |
3 | 1012112211222120222100 |
4 | 23233221130320330 |
5 | 201311300233302 |
6 | 5443155545100 |
7 | 624333644535 |
oct | 135751347074 |
9 | 35484876870 |
10 | 12610555452 |
11 | 5391369a60 |
12 | 253b2bb190 |
13 | 125c7b7a41 |
14 | 878b5168c |
15 | 4dc175d1c |
hex | 2efa5ce3c |
12610555452 has 72 divisors (see below), whose sum is σ = 35364026880. Its totient is φ = 3756604320.
The previous prime is 12610555427. The next prime is 12610555453. The reversal of 12610555452 is 25455501621.
12610555452 is a `hidden beast` number, since 1 + 2 + 6 + 105 + 5 + 545 + 2 = 666.
It is a super-2 number, since 2×126105554522 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12610555453) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 246508 + ... + 293235.
It is an arithmetic number, because the mean of its divisors is an integer number (491167040).
Almost surely, 212610555452 is an apocalyptic number.
12610555452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12610555452 is an abundant number, since it is smaller than the sum of its proper divisors (22753471428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12610555452 is a wasteful number, since it uses less digits than its factorization.
12610555452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539823 (or 539818 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 36.
The spelling of 12610555452 in words is "twelve billion, six hundred ten million, five hundred fifty-five thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •