Base | Representation |
---|---|
bin | 100101110101100101000… |
… | …001100000000111110100 |
3 | 100012120102221011010000110 |
4 | 211311211001200013310 |
5 | 320100101411402422 |
6 | 5310254212343020 |
7 | 355566100145502 |
oct | 45654501400764 |
9 | 10176387133013 |
10 | 2600150106612 |
11 | 912798a49733 |
12 | 35bb15014a70 |
13 | 15b26832a156 |
14 | 8dbc2a49672 |
15 | 479810eb60c |
hex | 25d650601f4 |
2600150106612 has 48 divisors (see below), whose sum is σ = 6115278339072. Its totient is φ = 859849200480.
The previous prime is 2600150106601. The next prime is 2600150106613. The reversal of 2600150106612 is 2166010510062.
It is a super-2 number, since 2×26001501066122 (a number of 26 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 2600150106612.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2600150106613) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 915564 + ... + 2457347.
It is an arithmetic number, because the mean of its divisors is an integer number (127401632064).
Almost surely, 22600150106612 is an apocalyptic number.
It is an amenable number.
2600150106612 is an abundant number, since it is smaller than the sum of its proper divisors (3515128232460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2600150106612 is a wasteful number, since it uses less digits than its factorization.
2600150106612 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3373428 (or 3373426 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 2600150106612 its reverse (2166010510062), we get a palindrome (4766160616674).
The spelling of 2600150106612 in words is "two trillion, six hundred billion, one hundred fifty million, one hundred six thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •