Base | Representation |
---|---|
bin | 1101111000010000011001… |
… | …01011110001011000000001 |
3 | 11000001201002201121200222112 |
4 | 12330020030223301120001 |
5 | 13000020433101001101 |
6 | 144524450502545105 |
7 | 6300005154026360 |
oct | 674101453613001 |
9 | 130051081550875 |
10 | 30520250406401 |
11 | 97a7624769608 |
12 | 350b042138195 |
13 | 140507caba302 |
14 | 77728bc397d7 |
15 | 37dd7d63c6bb |
hex | 1bc20caf1601 |
30520250406401 has 8 divisors (see below), whose sum is σ = 34903068873024. Its totient is φ = 26143127613360.
The previous prime is 30520250406391. The next prime is 30520250406407. The reversal of 30520250406401 is 10460405202503.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30520250406401 - 218 = 30520250144257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30520250406407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1423906910 + ... + 1423928343.
It is an arithmetic number, because the mean of its divisors is an integer number (4362883609128).
Almost surely, 230520250406401 is an apocalyptic number.
It is an amenable number.
30520250406401 is a deficient number, since it is larger than the sum of its proper divisors (4382818466623).
30520250406401 is a wasteful number, since it uses less digits than its factorization.
30520250406401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2847836791.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 30520250406401 its reverse (10460405202503), we get a palindrome (40980655608904).
The spelling of 30520250406401 in words is "thirty trillion, five hundred twenty billion, two hundred fifty million, four hundred six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •