Base | Representation |
---|---|
bin | 1000110011000110… |
… | …10111111110101000 |
3 | 110012012102100101000 |
4 | 10121203113332220 |
5 | 34133224432302 |
6 | 2100420355000 |
7 | 225025353300 |
oct | 43143277650 |
9 | 13165370330 |
10 | 4723670952 |
11 | 20044309a0 |
12 | ab9b45a60 |
13 | 5a382b090 |
14 | 32b4d0600 |
15 | 1c9a7131c |
hex | 1198d7fa8 |
4723670952 has 384 divisors, whose sum is σ = 17937763200. Its totient is φ = 1132185600.
The previous prime is 4723670869. The next prime is 4723670989. The reversal of 4723670952 is 2590763274.
It is a junction number, because it is equal to n+sod(n) for n = 4723670898 and 4723670907.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1511952 + ... + 1515072.
It is an arithmetic number, because the mean of its divisors is an integer number (46712925).
Almost surely, 24723670952 is an apocalyptic number.
4723670952 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4723670952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8968881600).
4723670952 is an abundant number, since it is smaller than the sum of its proper divisors (13214092248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4723670952 is a wasteful number, since it uses less digits than its factorization.
4723670952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3174 (or 3157 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 45.
The square root of 4723670952 is about 68728.9673427442. The cubic root of 4723670952 is about 1677.8760659555.
The spelling of 4723670952 in words is "four billion, seven hundred twenty-three million, six hundred seventy thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •