Base | Representation |
---|---|
bin | 111100000010000110011… |
… | …010010100100101100000 |
3 | 112121101102212102100010210 |
4 | 330002012122110211200 |
5 | 1020042331423314133 |
6 | 12435105442054120 |
7 | 604023562311441 |
oct | 74020632244540 |
9 | 15541385370123 |
10 | 4125423651168 |
11 | 1350645113126 |
12 | 56765004a340 |
13 | 23c044844241 |
14 | 103958b072c8 |
15 | 724a219d763 |
hex | 3c086694960 |
4125423651168 has 48 divisors (see below), whose sum is σ = 10829416466736. Its totient is φ = 1375118438400.
The previous prime is 4125423651161. The next prime is 4125423651179. The reversal of 4125423651168 is 8611563245214.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4125423651161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6071080 + ... + 6716312.
It is an arithmetic number, because the mean of its divisors is an integer number (225612843057).
Almost surely, 24125423651168 is an apocalyptic number.
4125423651168 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
4125423651168 is an abundant number, since it is smaller than the sum of its proper divisors (6703992815568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4125423651168 is a wasteful number, since it uses less digits than its factorization.
4125423651168 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 711847 (or 711839 counting only the distinct ones).
The product of its digits is 1382400, while the sum is 48.
The spelling of 4125423651168 in words is "four trillion, one hundred twenty-five billion, four hundred twenty-three million, six hundred fifty-one thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •