Base | Representation |
---|---|
bin | 1011011000101110… |
… | …1000010100101100 |
3 | 21220000100101121000 |
4 | 2312023220110230 |
5 | 22224431031220 |
6 | 1223143240300 |
7 | 135512560503 |
oct | 26613502454 |
9 | 7800311530 |
10 | 3056502060 |
11 | 1329352267 |
12 | 713749090 |
13 | 399308301 |
14 | 20dd1383a |
15 | 12d505390 |
hex | b62e852c |
3056502060 has 48 divisors (see below), whose sum is σ = 9509119200. Its totient is φ = 815067072.
The previous prime is 3056502047. The next prime is 3056502061. The reversal of 3056502060 is 602056503.
3056502060 is a `hidden beast` number, since 3 + 0 + 5 + 650 + 2 + 0 + 6 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (3056502061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2829555 + ... + 2830634.
It is an arithmetic number, because the mean of its divisors is an integer number (198106650).
Almost surely, 23056502060 is an apocalyptic number.
3056502060 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3056502060 is an abundant number, since it is smaller than the sum of its proper divisors (6452617140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3056502060 is a wasteful number, since it uses less digits than its factorization.
3056502060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5660207 (or 5660199 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The square root of 3056502060 is about 55285.6406311802. The cubic root of 3056502060 is about 1451.2477662232.
Adding to 3056502060 its reverse (602056503), we get a palindrome (3658558563).
The spelling of 3056502060 in words is "three billion, fifty-six million, five hundred two thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •