Base | Representation |
---|---|
bin | 1010111100011111… |
… | …1101101011111000 |
3 | 21120202112222011000 |
4 | 2233013331223320 |
5 | 22004123203342 |
6 | 1203313405000 |
7 | 132544304406 |
oct | 25707755370 |
9 | 7522488130 |
10 | 2938100472 |
11 | 127853240a |
12 | 69bb69760 |
13 | 37a920ab8 |
14 | 1dc2d2476 |
15 | 122e1844c |
hex | af1fdaf8 |
2938100472 has 128 divisors (see below), whose sum is σ = 8389785600. Its totient is φ = 952239744.
The previous prime is 2938100471. The next prime is 2938100489. The reversal of 2938100472 is 2740018392.
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 (2938100471) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1694518 + ... + 1696250.
It is an arithmetic number, because the mean of its divisors is an integer number (65545200).
Almost surely, 22938100472 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2938100472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4194892800).
2938100472 is an abundant number, since it is smaller than the sum of its proper divisors (5451685128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2938100472 is a wasteful number, since it uses less digits than its factorization.
2938100472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1962 (or 1952 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 2938100472 is about 54204.2477302287. The cubic root of 2938100472 is about 1432.2611580637.
The spelling of 2938100472 in words is "two billion, nine hundred thirty-eight million, one hundred thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •