Base | Representation |
---|---|
bin | 1001000010010111… |
… | …10010110000111110 |
3 | 110112010100020201201 |
4 | 10201023302300332 |
5 | 34414014110232 |
6 | 2121232530114 |
7 | 231141554125 |
oct | 44113626076 |
9 | 13463306651 |
10 | 4851706942 |
11 | 206a731265 |
12 | b349b093a |
13 | 5c4209914 |
14 | 3404dcabc |
15 | 1d5e12be7 |
hex | 1212f2c3e |
4851706942 has 32 divisors (see below), whose sum is σ = 7893860832. Its totient is φ = 2227513344.
The previous prime is 4851706907. The next prime is 4851706969. The reversal of 4851706942 is 2496071584.
It is a junction number, because it is equal to n+sod(n) for n = 4851706892 and 4851706901.
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, 2006118 + ... + 2008534.
It is an arithmetic number, because the mean of its divisors is an integer number (246683151).
Almost surely, 24851706942 is an apocalyptic number.
4851706942 is a deficient number, since it is larger than the sum of its proper divisors (3042153890).
4851706942 is a wasteful number, since it uses less digits than its factorization.
4851706942 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3852.
The product of its (nonzero) digits is 483840, while the sum is 46.
The square root of 4851706942 is about 69654.1954371738. The cubic root of 4851706942 is about 1692.9008384662.
The spelling of 4851706942 in words is "four billion, eight hundred fifty-one million, seven hundred six thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •