Base | Representation |
---|---|
bin | 1101111000011110011101… |
… | …11110011110101011011001 |
3 | 11000002102121020000202101110 |
4 | 12330033032332132223121 |
5 | 13000131421043322003 |
6 | 144532140253210533 |
7 | 6300363316352103 |
oct | 674171676365331 |
9 | 130072536022343 |
10 | 30527805057753 |
11 | 97aa851107a23 |
12 | 35105b0190a49 |
13 | 14059b4ca1903 |
14 | 7777a72d6573 |
15 | 37e1719b7a03 |
hex | 1bc3cef9ead9 |
30527805057753 has 32 divisors (see below), whose sum is σ = 43486849728000. Its totient is φ = 18992372990976.
The previous prime is 30527805057749. The next prime is 30527805057823. The reversal of 30527805057753 is 35775050872503.
It is not a de Polignac number, because 30527805057753 - 22 = 30527805057749 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a junction number, because it is equal to n+sod(n) for n = 30527805057693 and 30527805057702.
It is not an unprimeable number, because it can be changed into a prime (30527805057853) 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, 150990073 + ... + 151192121.
It is an arithmetic number, because the mean of its divisors is an integer number (1358964054000).
Almost surely, 230527805057753 is an apocalyptic number.
It is an amenable number.
30527805057753 is a deficient number, since it is larger than the sum of its proper divisors (12959044670247).
30527805057753 is a wasteful number, since it uses less digits than its factorization.
30527805057753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241701.
The product of its (nonzero) digits is 30870000, while the sum is 57.
The spelling of 30527805057753 in words is "thirty trillion, five hundred twenty-seven billion, eight hundred five million, fifty-seven thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •