Base | Representation |
---|---|
bin | 111100010111100100000011… |
… | …1011010010110100100010001 |
3 | 2120122010111102111022101212211 |
4 | 1320233020013122112210101 |
5 | 1024044432404410203403 |
6 | 5121203530532552121 |
7 | 216563531612410063 |
oct | 17057100732264421 |
9 | 2518114374271784 |
10 | 531004111022353 |
11 | 144215640472751 |
12 | 4b6801a2482641 |
13 | 19a3a61b9c2977 |
14 | 951aa43c23733 |
15 | 415c97ece406d |
hex | 1e2f207696911 |
531004111022353 has 16 divisors (see below), whose sum is σ = 544646293168320. Its totient is φ = 517394870611200.
The previous prime is 531004111022351. The next prime is 531004111022423. The reversal of 531004111022353 is 353220111400135.
It is a cyclic number.
It is not a de Polignac number, because 531004111022353 - 21 = 531004111022351 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (531004111022351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1036839118 + ... + 1037351128.
It is an arithmetic number, because the mean of its divisors is an integer number (34040393323020).
Almost surely, 2531004111022353 is an apocalyptic number.
It is an amenable number.
531004111022353 is a deficient number, since it is larger than the sum of its proper divisors (13642182145967).
531004111022353 is a wasteful number, since it uses less digits than its factorization.
531004111022353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 544128.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 531004111022353 its reverse (353220111400135), we get a palindrome (884224222422488).
The spelling of 531004111022353 in words is "five hundred thirty-one trillion, four billion, one hundred eleven million, twenty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •