Base | Representation |
---|---|
bin | 111101010111001… |
… | …0100100100000000 |
3 | 12022111022011112022 |
4 | 1322232110210000 |
5 | 13204043310300 |
6 | 540150421012 |
7 | 102010620110 |
oct | 17256244400 |
9 | 5274264468 |
10 | 2058963200 |
11 | 96725a588 |
12 | 495661768 |
13 | 26a750428 |
14 | 157647040 |
15 | c0b5d285 |
hex | 7ab94900 |
2058963200 has 108 divisors (see below), whose sum is σ = 5824418880. Its totient is φ = 705914880.
The previous prime is 2058963191. The next prime is 2058963223. The reversal of 2058963200 is 23698502.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21821 + ... + 67779.
Almost surely, 22058963200 is an apocalyptic number.
2058963200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2058963200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2912209440).
2058963200 is an abundant number, since it is smaller than the sum of its proper divisors (3765455680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2058963200 is an equidigital number, since it uses as much as digits as its factorization.
2058963200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45992 (or 45973 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 35.
The square root of 2058963200 is about 45375.7997174705. The cubic root of 2058963200 is about 1272.1828251379.
The spelling of 2058963200 in words is "two billion, fifty-eight million, nine hundred sixty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •