Base | Representation |
---|---|
bin | 101111011101101000010… |
… | …101001010010100001011 |
3 | 102112210211122022120012121 |
4 | 233131220111022110023 |
5 | 411414304410233103 |
6 | 10534212234152111 |
7 | 454434150166453 |
oct | 57355025122413 |
9 | 12483748276177 |
10 | 3261630555403 |
11 | 1048282466390 |
12 | 448161582637 |
13 | 1a875534ca2c |
14 | b3c14236d63 |
15 | 59c986536bd |
hex | 2f76854a50b |
3261630555403 has 4 divisors (see below), whose sum is σ = 3558142424088. Its totient is φ = 2965118686720.
The previous prime is 3261630555397. The next prime is 3261630555467. The reversal of 3261630555403 is 3045550361623.
3261630555403 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3261630555403 - 25 = 3261630555371 is a prime.
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 3261630555403.
It is not an unprimeable number, because it can be changed into a prime (3261630555493) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 148255934326 + ... + 148255934347.
It is an arithmetic number, because the mean of its divisors is an integer number (889535606022).
Almost surely, 23261630555403 is an apocalyptic number.
3261630555403 is a deficient number, since it is larger than the sum of its proper divisors (296511868685).
3261630555403 is a wasteful number, since it uses less digits than its factorization.
3261630555403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296511868684.
The product of its (nonzero) digits is 972000, while the sum is 43.
The spelling of 3261630555403 in words is "three trillion, two hundred sixty-one billion, six hundred thirty million, five hundred fifty-five thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •