Base | Representation |
---|---|
bin | 11011111000000101… |
… | …10010010010111100 |
3 | 1102122000011221000112 |
4 | 31330002302102330 |
5 | 221122244210342 |
6 | 10513021245152 |
7 | 1036604650250 |
oct | 157402622274 |
9 | 42560157015 |
10 | 14966006972 |
11 | 638aa14604 |
12 | 2a981037b8 |
13 | 15467a6737 |
14 | a1d8d6260 |
15 | 5c8d4c682 |
hex | 37c0b24bc |
14966006972 has 24 divisors (see below), whose sum is σ = 29941601760. Its totient is φ = 6411948480.
The previous prime is 14966006959. The next prime is 14966006983. The reversal of 14966006972 is 27960066941.
14966006972 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 14966006972.
It is a congruent number.
It is an unprimeable number.
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, 5054 + ... + 173082.
It is an arithmetic number, because the mean of its divisors is an integer number (1247566740).
Almost surely, 214966006972 is an apocalyptic number.
It is an amenable number.
14966006972 is an abundant number, since it is smaller than the sum of its proper divisors (14975594788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14966006972 is a wasteful number, since it uses less digits than its factorization.
14966006972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171221 (or 171219 counting only the distinct ones).
The product of its (nonzero) digits is 979776, while the sum is 50.
The spelling of 14966006972 in words is "fourteen billion, nine hundred sixty-six million, six thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •