Base | Representation |
---|---|
bin | 1101111111101111101100… |
… | …11111011001010100001010 |
3 | 11000222022022012022102001210 |
4 | 12333313312133121110022 |
5 | 13013224433440214010 |
6 | 145243005005353550 |
7 | 6324415012242615 |
oct | 677676637312412 |
9 | 130868265272053 |
10 | 30777576101130 |
11 | 9896773380721 |
12 | 3550a97b688b6 |
13 | 142340b7a83c1 |
14 | 7858dd54917c |
15 | 3858de657b20 |
hex | 1bfdf67d950a |
30777576101130 has 32 divisors (see below), whose sum is σ = 73889331159168. Its totient is φ = 8204781569600.
The previous prime is 30777576101101. The next prime is 30777576101137. The reversal of 30777576101130 is 3110167577703.
It is a self number, because there is not a number n which added to its sum of digits gives 30777576101130.
It is not an unprimeable number, because it can be changed into a prime (30777576101137) 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 15 ways as a sum of consecutive naturals, for example, 160656261 + ... + 160847720.
It is an arithmetic number, because the mean of its divisors is an integer number (2309041598724).
Almost surely, 230777576101130 is an apocalyptic number.
30777576101130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
30777576101130 is an abundant number, since it is smaller than the sum of its proper divisors (43111755058038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30777576101130 is a wasteful number, since it uses less digits than its factorization.
30777576101130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321507182.
The product of its (nonzero) digits is 648270, while the sum is 48.
The spelling of 30777576101130 in words is "thirty trillion, seven hundred seventy-seven billion, five hundred seventy-six million, one hundred one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •