Base | Representation |
---|---|
bin | 1011101110000101… |
… | …0000100101000000 |
3 | 22010020212022022110 |
4 | 2323201100211000 |
5 | 22420342324143 |
6 | 1240102535320 |
7 | 140651023620 |
oct | 27341204500 |
9 | 8106768273 |
10 | 3146058048 |
11 | 137495aa81 |
12 | 739737540 |
13 | 3b1a33113 |
14 | 21bb86880 |
15 | 1362e5533 |
hex | bb850940 |
3146058048 has 112 divisors (see below), whose sum is σ = 9527462784. Its totient is φ = 897515520.
The previous prime is 3146058031. The next prime is 3146058061. The reversal of 3146058048 is 8408506413.
It is a tau number, because it is divible by the number of its divisors (112).
It is a junction number, because it is equal to n+sod(n) for n = 3146057997 and 3146058015.
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, 1182736 + ... + 1185392.
It is an arithmetic number, because the mean of its divisors is an integer number (85066632).
Almost surely, 23146058048 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 3146058048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4763731392).
3146058048 is an abundant number, since it is smaller than the sum of its proper divisors (6381404736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3146058048 is a wasteful number, since it uses less digits than its factorization.
3146058048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3560 (or 3550 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 39.
The square root of 3146058048 is about 56089.7321084706. The cubic root of 3146058048 is about 1465.2854725247.
The spelling of 3146058048 in words is "three billion, one hundred forty-six million, fifty-eight thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •