Base | Representation |
---|---|
bin | 111011110100000010010001… |
… | …1100011000011000000110111 |
3 | 2112222211200210101122020222210 |
4 | 1313220010203203003000313 |
5 | 1022424432212020414210 |
6 | 5102544424532024503 |
7 | 215551000633220064 |
oct | 16750044343030067 |
9 | 2488750711566883 |
10 | 526121205248055 |
11 | 14270282845804a |
12 | 4b011993162133 |
13 | 1977502ab029b1 |
14 | 93cc58b907c6b |
15 | 40c59473e7e20 |
hex | 1de81238c3037 |
526121205248055 has 64 divisors (see below), whose sum is σ = 908703671040000. Its totient is φ = 259137092239872.
The previous prime is 526121205248033. The next prime is 526121205248057. The reversal of 526121205248055 is 550842502121625.
It is not a de Polignac number, because 526121205248055 - 26 = 526121205247991 is a prime.
It is a super-3 number, since 3×5261212052480553 (a number of 45 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 526121205247995 and 526121205248013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (526121205248057) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 459147526 + ... + 460291964.
It is an arithmetic number, because the mean of its divisors is an integer number (14198494860000).
Almost surely, 2526121205248055 is an apocalyptic number.
526121205248055 is a deficient number, since it is larger than the sum of its proper divisors (382582465791945).
526121205248055 is a wasteful number, since it uses less digits than its factorization.
526121205248055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1190448.
The product of its (nonzero) digits is 1920000, while the sum is 48.
The spelling of 526121205248055 in words is "five hundred twenty-six trillion, one hundred twenty-one billion, two hundred five million, two hundred forty-eight thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •