Base | Representation |
---|---|
bin | 111100010001001011100110… |
… | …1101000111110101110110100 |
3 | 2120112000122100220210221200210 |
4 | 1320202113031220332232310 |
5 | 1023441100012410344342 |
6 | 5115252544531305420 |
7 | 216443260321513155 |
oct | 17042271550765664 |
9 | 2515018326727623 |
10 | 530126968449972 |
11 | 143a07648343603 |
12 | 4b55a1a914b270 |
13 | 199a59b28c787a |
14 | 94ca3d441592c |
15 | 4144c4431379c |
hex | 1e225cda3ebb4 |
530126968449972 has 12 divisors (see below), whose sum is σ = 1236962926383296. Its totient is φ = 176708989483320.
The previous prime is 530126968449929. The next prime is 530126968449983. The reversal of 530126968449972 is 279944869621035.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 530126968449894 and 530126968449903.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22088623685404 + ... + 22088623685427.
It is a 1-persistent number, because it is pandigital, but 2⋅530126968449972 = 1060253936899944 is not.
Almost surely, 2530126968449972 is an apocalyptic number.
It is an amenable number.
530126968449972 is an abundant number, since it is smaller than the sum of its proper divisors (706835957933324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530126968449972 is a wasteful number, since it uses less digits than its factorization.
530126968449972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44177247370838 (or 44177247370836 counting only the distinct ones).
The product of its (nonzero) digits is 1410877440, while the sum is 75.
The spelling of 530126968449972 in words is "five hundred thirty trillion, one hundred twenty-six billion, nine hundred sixty-eight million, four hundred forty-nine thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •