Base | Representation |
---|---|
bin | 1101110011000001011101… |
… | …10111000001101000100101 |
3 | 10222102111222002111111211211 |
4 | 12321200232313001220211 |
5 | 12434044202344433433 |
6 | 144310111542031421 |
7 | 6251011160434351 |
oct | 671405667015045 |
9 | 128374862444754 |
10 | 30340435155493 |
11 | 9738340743131 |
12 | 34a021a418571 |
13 | 13c1124520468 |
14 | 76c6b07b2461 |
15 | 3793572798cd |
hex | 1b982edc1a25 |
30340435155493 has 2 divisors, whose sum is σ = 30340435155494. Its totient is φ = 30340435155492.
The previous prime is 30340435155491. The next prime is 30340435155571. The reversal of 30340435155493 is 39455153404303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16429459768929 + 13910975386564 = 4053327^2 + 3729742^2 .
It is a cyclic number.
It is not a de Polignac number, because 30340435155493 - 21 = 30340435155491 is a prime.
Together with 30340435155491, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30340435155491) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15170217577746 + 15170217577747.
It is an arithmetic number, because the mean of its divisors is an integer number (15170217577747).
Almost surely, 230340435155493 is an apocalyptic number.
It is an amenable number.
30340435155493 is a deficient number, since it is larger than the sum of its proper divisors (1).
30340435155493 is an equidigital number, since it uses as much as digits as its factorization.
30340435155493 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832000, while the sum is 49.
Adding to 30340435155493 its reverse (39455153404303), we get a palindrome (69795588559796).
The spelling of 30340435155493 in words is "thirty trillion, three hundred forty billion, four hundred thirty-five million, one hundred fifty-five thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •