Base | Representation |
---|---|
bin | 1100100100101000110… |
… | …10101110100100100100 |
3 | 1112022000220022100022022 |
4 | 12102110122232210210 |
5 | 24034202102422233 |
6 | 530241343322312 |
7 | 43132014623636 |
oct | 6222432564444 |
9 | 1468026270268 |
10 | 431986764068 |
11 | 1572282a2702 |
12 | 6b87b5b0398 |
13 | 319754c5082 |
14 | 16ca041ca56 |
15 | b384b6d398 |
hex | 64946ae924 |
431986764068 has 6 divisors (see below), whose sum is σ = 755976837126. Its totient is φ = 215993382032.
The previous prime is 431986764067. The next prime is 431986764089. The reversal of 431986764068 is 860467689134.
It can be written as a sum of positive squares in only one way, i.e., 264712308004 + 167274456064 = 514502^2 + 408992^2 .
It is a super-2 number, since 2×4319867640682 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 431986764068.
It is not an unprimeable number, because it can be changed into a prime (431986764067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53998345505 + ... + 53998345512.
It is an arithmetic number, because the mean of its divisors is an integer number (125996139521).
Almost surely, 2431986764068 is an apocalyptic number.
It is an amenable number.
431986764068 is a deficient number, since it is larger than the sum of its proper divisors (323990073058).
431986764068 is a wasteful number, since it uses less digits than its factorization.
431986764068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107996691021 (or 107996691019 counting only the distinct ones).
The product of its (nonzero) digits is 41803776, while the sum is 62.
The spelling of 431986764068 in words is "four hundred thirty-one billion, nine hundred eighty-six million, seven hundred sixty-four thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •