Base | Representation |
---|---|
bin | 10010010101110100001… |
… | …01011111110100100000 |
3 | 2020020121211110011000022 |
4 | 21022322011133310200 |
5 | 40311110412302243 |
6 | 1201300511213012 |
7 | 63346425026261 |
oct | 11127205376440 |
9 | 2206554404008 |
10 | 630187228448 |
11 | 223296297088 |
12 | a2174517168 |
13 | 47570a5766b |
14 | 22703508968 |
15 | 115d512bb68 |
hex | 92ba15fd20 |
630187228448 has 18 divisors (see below), whose sum is σ = 1240689947049. Its totient is φ = 315091368896.
The previous prime is 630187228427. The next prime is 630187228453. The reversal of 630187228448 is 844822781036.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 476469911824 + 153717316624 = 690268^2 + 392068^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=561332.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 630187228448.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 4420490 + ... + 4560822.
Almost surely, 2630187228448 is an apocalyptic number.
It is an amenable number.
630187228448 is a deficient number, since it is larger than the sum of its proper divisors (610502718601).
630187228448 is an frugal number, since it uses more digits than its factorization.
630187228448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280676 (or 140335 counting only the distinct ones).
The product of its (nonzero) digits is 4128768, while the sum is 53.
The spelling of 630187228448 in words is "six hundred thirty billion, one hundred eighty-seven million, two hundred twenty-eight thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •