Base | Representation |
---|---|
bin | 1001011100011110… |
… | …00100110010111010 |
3 | 111002101100202222220 |
4 | 10232033010302322 |
5 | 40341042433114 |
6 | 2155054024510 |
7 | 236440664322 |
oct | 45617046272 |
9 | 14071322886 |
10 | 5070671034 |
11 | 2172297220 |
12 | b961a8136 |
13 | 62a6a3980 |
14 | 36161a282 |
15 | 1ea2660a9 |
hex | 12e3c4cba |
5070671034 has 128 divisors (see below), whose sum is σ = 12492361728. Its totient is φ = 1350159360.
The previous prime is 5070671003. The next prime is 5070671063. The reversal of 5070671034 is 4301760705.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 5070670986 and 5070671004.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5189554 + ... + 5190530.
It is an arithmetic number, because the mean of its divisors is an integer number (97596576).
Almost surely, 25070671034 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5070671034, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6246180864).
5070671034 is an abundant number, since it is smaller than the sum of its proper divisors (7421690694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5070671034 is a wasteful number, since it uses less digits than its factorization.
5070671034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1292.
The product of its (nonzero) digits is 17640, while the sum is 33.
The square root of 5070671034 is about 71208.6443769294. The cubic root of 5070671034 is about 1717.9946696298.
The spelling of 5070671034 in words is "five billion, seventy million, six hundred seventy-one thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •