Base | Representation |
---|---|
bin | 1101111000011010010010… |
… | …01011100111100110110111 |
3 | 11000002012210210020001102220 |
4 | 12330031021023213212313 |
5 | 13000112321422332010 |
6 | 144531125425333423 |
7 | 6300253561611000 |
oct | 674151113474667 |
9 | 130065723201386 |
10 | 30525560355255 |
11 | 97a98aa025799 |
12 | 3510084497273 |
13 | 1405717c1b194 |
14 | 7776331401a7 |
15 | 37e08e8ba970 |
hex | 1bc3492e79b7 |
30525560355255 has 32 divisors (see below), whose sum is σ = 56957313792000. Its totient is φ = 13954541874336.
The previous prime is 30525560355163. The next prime is 30525560355271. The reversal of 30525560355255 is 55255306552503.
It is not a de Polignac number, because 30525560355255 - 28 = 30525560354999 is a prime.
It is a super-2 number, since 2×305255603552552 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30525560355198 and 30525560355207.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2966521615 + ... + 2966531904.
It is an arithmetic number, because the mean of its divisors is an integer number (1779916056000).
Almost surely, 230525560355255 is an apocalyptic number.
30525560355255 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
30525560355255 is a deficient number, since it is larger than the sum of its proper divisors (26431753436745).
30525560355255 is an equidigital number, since it uses as much as digits as its factorization.
30525560355255 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5933053548 (or 5933053534 counting only the distinct ones).
The product of its (nonzero) digits is 16875000, while the sum is 51.
The spelling of 30525560355255 in words is "thirty trillion, five hundred twenty-five billion, five hundred sixty million, three hundred fifty-five thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •