Base | Representation |
---|---|
bin | 111100010100000111110011… |
… | …1101100101011111111100001 |
3 | 2120120110021120210212210020101 |
4 | 1320220033213230223333201 |
5 | 1024014210224413231413 |
6 | 5120202345422542401 |
7 | 216514416015645565 |
oct | 17050174754537741 |
9 | 2516407523783211 |
10 | 530531132555233 |
11 | 144052a98455907 |
12 | 4b6045a2a37a01 |
13 | 19a04b42b54804 |
14 | 9501bb56496a5 |
15 | 41504eb59aedd |
hex | 1e283e7b2bfe1 |
530531132555233 has 32 divisors (see below), whose sum is σ = 541459869350400. Its totient is φ = 519729510537216.
The previous prime is 530531132555231. The next prime is 530531132555293. The reversal of 530531132555233 is 332555231135035.
It is a cyclic number.
It is not a de Polignac number, because 530531132555233 - 21 = 530531132555231 is a prime.
It is a super-2 number, since 2×5305311325552332 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (530531132555231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21767153635 + ... + 21767178007.
It is an arithmetic number, because the mean of its divisors is an integer number (16920620917200).
Almost surely, 2530531132555233 is an apocalyptic number.
It is an amenable number.
530531132555233 is a deficient number, since it is larger than the sum of its proper divisors (10928736795167).
530531132555233 is a wasteful number, since it uses less digits than its factorization.
530531132555233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27601.
The product of its (nonzero) digits is 3037500, while the sum is 46.
The spelling of 530531132555233 in words is "five hundred thirty trillion, five hundred thirty-one billion, one hundred thirty-two million, five hundred fifty-five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •