Base | Representation |
---|---|
bin | 1111011110010011111… |
… | …11110101001010011001 |
3 | 1212211022222202212210221 |
4 | 13233021333311022121 |
5 | 32202330000240044 |
6 | 1044125031440041 |
7 | 53261163562564 |
oct | 7571177651231 |
9 | 1784288685727 |
10 | 531669930649 |
11 | 1955308a7100 |
12 | 8705b226021 |
13 | 3b1a0491a00 |
14 | 1ba393674db |
15 | dc6b171484 |
hex | 7bc9ff5299 |
531669930649 has 27 divisors (see below), whose sum is σ = 632933285439. Its totient is φ = 446069086320.
The previous prime is 531669930637. The next prime is 531669930679. The reversal of 531669930649 is 946039966135.
The square root of 531669930649 is 729157.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 78649398025 + 453020532624 = 280445^2 + 673068^2 .
It is not a de Polignac number, because 531669930649 - 215 = 531669897881 is a prime.
It is a super-2 number, since 2×5316699306492 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (531669930679) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 104266902 + ... + 104272000.
Almost surely, 2531669930649 is an apocalyptic number.
531669930649 is the 729157-th square number.
531669930649 is the 364579-th centered octagonal number.
It is an amenable number.
531669930649 is a deficient number, since it is larger than the sum of its proper divisors (101263354790).
531669930649 is an frugal number, since it uses more digits than its factorization.
531669930649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10246 (or 5123 counting only the distinct ones).
The product of its (nonzero) digits is 28343520, while the sum is 61.
The spelling of 531669930649 in words is "five hundred thirty-one billion, six hundred sixty-nine million, nine hundred thirty thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •