Base | Representation |
---|---|
bin | 1101111001010010001111… |
… | …11111011000011010000101 |
3 | 11000012002100122210022110221 |
4 | 12330221013333120122011 |
5 | 13001110334404004000 |
6 | 144553015021344341 |
7 | 6302366244226621 |
oct | 674510777303205 |
9 | 130162318708427 |
10 | 30555605141125 |
11 | 9810617579039 |
12 | 3515a6a4080b1 |
13 | 14084c566429c |
14 | 778c834c6181 |
15 | 37ec4c3de61a |
hex | 1bca47fd8685 |
30555605141125 has 16 divisors (see below), whose sum is σ = 38326965781104. Its totient is φ = 24320400417600.
The previous prime is 30555605141063. The next prime is 30555605141137. The reversal of 30555605141125 is 52114150655503.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 587272397569 + 29968332743556 = 766337^2 + 5474334^2 .
It is not a de Polignac number, because 30555605141125 - 217 = 30555605010053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 620393754 + ... + 620443003.
It is an arithmetic number, because the mean of its divisors is an integer number (2395435361319).
Almost surely, 230555605141125 is an apocalyptic number.
It is an amenable number.
30555605141125 is a deficient number, since it is larger than the sum of its proper divisors (7771360639979).
30555605141125 is a wasteful number, since it uses less digits than its factorization.
30555605141125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1240836969 (or 1240836959 counting only the distinct ones).
The product of its (nonzero) digits is 450000, while the sum is 43.
Adding to 30555605141125 its reverse (52114150655503), we get a palindrome (82669755796628).
The spelling of 30555605141125 in words is "thirty trillion, five hundred fifty-five billion, six hundred five million, one hundred forty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •