Base | Representation |
---|---|
bin | 1000111101001010011110000… |
… | …1110101011111010010011100 |
3 | 10001122100112110201001120200210 |
4 | 2033102213201311133102130 |
5 | 1130100144143042121142 |
6 | 10112153523140052420 |
7 | 246512310415461366 |
oct | 21722474165372234 |
9 | 3048315421046623 |
10 | 630200045270172 |
11 | 17288a37a301363 |
12 | 5a820ba8094110 |
13 | 210847bc758610 |
14 | b189bb8721d36 |
15 | 4ccce393ae49c |
hex | 23d29e1d5f49c |
630200045270172 has 96 divisors (see below), whose sum is σ = 1585079746387200. Its totient is φ = 193724027684352.
The previous prime is 630200045270041. The next prime is 630200045270179. The reversal of 630200045270172 is 271072540002036.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 630200045270172.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (630200045270179) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6923784079 + ... + 6923875097.
It is an arithmetic number, because the mean of its divisors is an integer number (16511247358200).
Almost surely, 2630200045270172 is an apocalyptic number.
It is an amenable number.
630200045270172 is an abundant number, since it is smaller than the sum of its proper divisors (954879701117028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
630200045270172 is a wasteful number, since it uses less digits than its factorization.
630200045270172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132595 (or 132593 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 39.
The spelling of 630200045270172 in words is "six hundred thirty trillion, two hundred billion, forty-five million, two hundred seventy thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •