Base | Representation |
---|---|
bin | 1010100111100000… |
… | …10100010100000010 |
3 | 112201020211020021220 |
4 | 11103300110110002 |
5 | 43133214023323 |
6 | 2341341455510 |
7 | 261153260532 |
oct | 52360242402 |
9 | 15636736256 |
10 | 5700142338 |
11 | 2465644340 |
12 | 1130b71596 |
13 | 6cac1a9b7 |
14 | 3c10754c2 |
15 | 2356560e3 |
hex | 153c14502 |
5700142338 has 64 divisors (see below), whose sum is σ = 12778698240. Its totient is φ = 1680422400.
The previous prime is 5700142309. The next prime is 5700142339. The reversal of 5700142338 is 8332410075.
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 = 5700142299 and 5700142308.
It is not an unprimeable number, because it can be changed into a prime (5700142339) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 370173 + ... + 385263.
It is an arithmetic number, because the mean of its divisors is an integer number (199667160).
Almost surely, 25700142338 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5700142338, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6389349120).
5700142338 is an abundant number, since it is smaller than the sum of its proper divisors (7078555902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5700142338 is a wasteful number, since it uses less digits than its factorization.
5700142338 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15263.
The product of its (nonzero) digits is 20160, while the sum is 33.
The square root of 5700142338 is about 75499.2870032559. The cubic root of 5700142338 is about 1786.3308566279.
The spelling of 5700142338 in words is "five billion, seven hundred million, one hundred forty-two thousand, three hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •