Base | Representation |
---|---|
bin | 100110000001000000010… |
… | …111110100110100011010 |
3 | 100020202010001022112101210 |
4 | 212001000113310310122 |
5 | 320300214021302300 |
6 | 5320043525123550 |
7 | 356512130331153 |
oct | 46010027646432 |
9 | 10222101275353 |
10 | 2612420103450 |
11 | 917a15051993 |
12 | 36237a2595b6 |
13 | 15c4723b6201 |
14 | 9062846a92a |
15 | 47e4d401050 |
hex | 260405f4d1a |
2612420103450 has 96 divisors (see below), whose sum is σ = 6509743617600. Its totient is φ = 693320785920.
The previous prime is 2612420103431. The next prime is 2612420103467. The reversal of 2612420103450 is 543010242162.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 92353009 + ... + 92381291.
It is an arithmetic number, because the mean of its divisors is an integer number (67809829350).
Almost surely, 22612420103450 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2612420103450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3254871808800).
2612420103450 is an abundant number, since it is smaller than the sum of its proper divisors (3897323514150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2612420103450 is a wasteful number, since it uses less digits than its factorization.
2612420103450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31216 (or 31211 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
The spelling of 2612420103450 in words is "two trillion, six hundred twelve billion, four hundred twenty million, one hundred three thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •