Base | Representation |
---|---|
bin | 111000101110101100111… |
… | …100111111011001010100 |
3 | 111210200112210000002021022 |
4 | 320232230330333121110 |
5 | 1002332444333210212 |
6 | 12142530042340312 |
7 | 551436621545366 |
oct | 70565474773124 |
9 | 14720483002238 |
10 | 3898437006932 |
11 | 1273355070766 |
12 | 52b6627ba698 |
13 | 22380c53c630 |
14 | d698489cd36 |
15 | 6b619931772 |
hex | 38bacf3f654 |
3898437006932 has 24 divisors (see below), whose sum is σ = 7600401064200. Its totient is φ = 1737234527616.
The previous prime is 3898437006931. The next prime is 3898437006941. The reversal of 3898437006932 is 2396007348983.
It can be written as a sum of positive squares in 4 ways, for example, as 16 + 3898437006916 = 4^2 + 1974446^2 .
It is a super-2 number, since 2×38984370069322 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3898437006931) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1292583707 + ... + 1292586722.
It is an arithmetic number, because the mean of its divisors is an integer number (316683377675).
Almost surely, 23898437006932 is an apocalyptic number.
It is an amenable number.
3898437006932 is a deficient number, since it is larger than the sum of its proper divisors (3701964057268).
3898437006932 is a wasteful number, since it uses less digits than its factorization.
3898437006932 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2585170475 (or 2585170473 counting only the distinct ones).
The product of its (nonzero) digits is 47029248, while the sum is 62.
The spelling of 3898437006932 in words is "three trillion, eight hundred ninety-eight billion, four hundred thirty-seven million, six thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •