Base | Representation |
---|---|
bin | 11000011101100000011… |
… | …01000001100011011100 |
3 | 2222100102010122222122021 |
4 | 30032300031001203130 |
5 | 102232243023430342 |
6 | 1442035300225524 |
7 | 114502515104014 |
oct | 14166015014334 |
9 | 2870363588567 |
10 | 840474826972 |
11 | 2a4497146320 |
12 | 116a8139b2a4 |
13 | 6134450c131 |
14 | 2c971a14c44 |
15 | 16ce181d567 |
hex | c3b03418dc |
840474826972 has 24 divisors (see below), whose sum is σ = 1630846837872. Its totient is φ = 375771158400.
The previous prime is 840474826967. The next prime is 840474826973. The reversal of 840474826972 is 279628474048.
It is a super-2 number, since 2×8404748269722 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (61).
It is a self number, because there is not a number n which added to its sum of digits gives 840474826972.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (840474826973) 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 in 7 ways as a sum of consecutive naturals, for example, 156568633 + ... + 156574000.
It is an arithmetic number, because the mean of its divisors is an integer number (67951951578).
Almost surely, 2840474826972 is an apocalyptic number.
It is an amenable number.
840474826972 is a deficient number, since it is larger than the sum of its proper divisors (790372010900).
840474826972 is a wasteful number, since it uses less digits than its factorization.
840474826972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313142709 (or 313142707 counting only the distinct ones).
The product of its (nonzero) digits is 43352064, while the sum is 61.
The spelling of 840474826972 in words is "eight hundred forty billion, four hundred seventy-four million, eight hundred twenty-six thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •