Base | Representation |
---|---|
bin | 111010000101110101100… |
… | …010101010100001100010 |
3 | 112010122001002221212001121 |
4 | 322011311202222201202 |
5 | 1010401102114424310 |
6 | 12253521542122454 |
7 | 561261253365100 |
oct | 72056542524142 |
9 | 15118032855047 |
10 | 3991996639330 |
11 | 12a9aa6039307 |
12 | 54581372042a |
13 | 22c59c979a6b |
14 | db2dc43cc70 |
15 | 6dc935490da |
hex | 3a1758aa862 |
3991996639330 has 48 divisors (see below), whose sum is σ = 8359546700736. Its totient is φ = 1368554460000.
The previous prime is 3991996639307. The next prime is 3991996639357. The reversal of 3991996639330 is 339366991993.
It is a Smith number, since the sum of its digits (70) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (70).
It is a self number, because there is not a number n which added to its sum of digits gives 3991996639330.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4844955 + ... + 5608705.
It is an arithmetic number, because the mean of its divisors is an integer number (174157222932).
Almost surely, 23991996639330 is an apocalyptic number.
3991996639330 is an abundant number, since it is smaller than the sum of its proper divisors (4367550061406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3991996639330 is a wasteful number, since it uses less digits than its factorization.
3991996639330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 774439 (or 774432 counting only the distinct ones).
The product of its (nonzero) digits is 172186884, while the sum is 70.
The spelling of 3991996639330 in words is "three trillion, nine hundred ninety-one billion, nine hundred ninety-six million, six hundred thirty-nine thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •