Base | Representation |
---|---|
bin | 1010001110000101… |
… | …0110111101010010 |
3 | 21002012020201211100 |
4 | 2203201112331102 |
5 | 21104304242434 |
6 | 1132121125230 |
7 | 124661531043 |
oct | 24341267522 |
9 | 7065221740 |
10 | 2743430994 |
11 | 1188660347 |
12 | 646929816 |
13 | 3494b1b65 |
14 | 1c04da8ca |
15 | 110cb3699 |
hex | a3856f52 |
2743430994 has 48 divisors (see below), whose sum is σ = 6193324800. Its totient is φ = 876687840.
The previous prime is 2743430993. The next prime is 2743431037. The reversal of 2743430994 is 4990343472.
2743430994 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (2743430993) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36732 + ... + 82680.
It is an arithmetic number, because the mean of its divisors is an integer number (129027600).
Almost surely, 22743430994 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2743430994, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3096662400).
2743430994 is an abundant number, since it is smaller than the sum of its proper divisors (3449893806).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2743430994 is a wasteful number, since it uses less digits than its factorization.
2743430994 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46095 (or 46092 counting only the distinct ones).
The product of its (nonzero) digits is 653184, while the sum is 45.
The square root of 2743430994 is about 52377.7719457405. The cubic root of 2743430994 is about 1399.9032235825.
The spelling of 2743430994 in words is "two billion, seven hundred forty-three million, four hundred thirty thousand, nine hundred ninety-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •