Base | Representation |
---|---|
bin | 1011011001111010… |
… | …0011001011000100 |
3 | 21220100200100221101 |
4 | 2312132203023010 |
5 | 22232213233300 |
6 | 1223441425444 |
7 | 135602665213 |
oct | 26636431304 |
9 | 7810610841 |
10 | 3061461700 |
11 | 133112a540 |
12 | 71533b284 |
13 | 39a3538cb |
14 | 21084507a |
15 | 12db84b6a |
hex | b67a32c4 |
3061461700 has 72 divisors (see below), whose sum is σ = 7259785344. Its totient is φ = 1111344000.
The previous prime is 3061461691. The next prime is 3061461707. The reversal of 3061461700 is 71641603.
3061461700 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (3061461707) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 742645 + ... + 746755.
It is an arithmetic number, because the mean of its divisors is an integer number (100830352).
Almost surely, 23061461700 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3061461700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3629892672).
3061461700 is an abundant number, since it is smaller than the sum of its proper divisors (4198323644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3061461700 is a wasteful number, since it uses less digits than its factorization.
3061461700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4813 (or 4806 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 28.
The square root of 3061461700 is about 55330.4771351197. The cubic root of 3061461700 is about 1452.0322988613.
The spelling of 3061461700 in words is "three billion, sixty-one million, four hundred sixty-one thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •