Base | Representation |
---|---|
bin | 1001111111110100… |
… | …1101111010110110 |
3 | 20221000201021121210 |
4 | 2133331031322312 |
5 | 20444002001032 |
6 | 1122143222250 |
7 | 123334303002 |
oct | 23775157266 |
9 | 6830637553 |
10 | 2683625142 |
11 | 1157922320 |
12 | 62a8a7986 |
13 | 339ca2393 |
14 | 1b65ad702 |
15 | 10a8ed2cc |
hex | 9ff4deb6 |
2683625142 has 64 divisors (see below), whose sum is σ = 6320540160. Its totient is φ = 751027200.
The previous prime is 2683625137. The next prime is 2683625167. The reversal of 2683625142 is 2415263862.
It is a self number, because there is not a number n which added to its sum of digits gives 2683625142.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13542 + ... + 74502.
It is an arithmetic number, because the mean of its divisors is an integer number (98758440).
Almost surely, 22683625142 is an apocalyptic number.
2683625142 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 2683625142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3160270080).
2683625142 is an abundant number, since it is smaller than the sum of its proper divisors (3636915018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2683625142 is a wasteful number, since it uses less digits than its factorization.
2683625142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61029.
The product of its digits is 138240, while the sum is 39.
The square root of 2683625142 is about 51803.7174534801. The cubic root of 2683625142 is about 1389.6559267756.
The spelling of 2683625142 in words is "two billion, six hundred eighty-three million, six hundred twenty-five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •