Base | Representation |
---|---|
bin | 110100010111010100… |
… | …0001000111100111111 |
3 | 101202020221012012222220 |
4 | 1220232220020330333 |
5 | 3320300031032223 |
6 | 123354240140423 |
7 | 11060436222246 |
oct | 1505650107477 |
9 | 352227165886 |
10 | 112451424063 |
11 | 43765996310 |
12 | 19963907713 |
13 | a7b134c1a4 |
14 | 562a9cb95d |
15 | 2dd242a6e3 |
hex | 1a2ea08f3f |
112451424063 has 8 divisors (see below), whose sum is σ = 163565707776. Its totient is φ = 68152378200.
The previous prime is 112451424037. The next prime is 112451424139. The reversal of 112451424063 is 360424154211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112451424063 - 28 = 112451423807 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 3407618911 = 112451424063 / (1 + 1 + 2 + 4 + 5 + 1 + 4 + 2 + 4 + 0 + 6 + 3).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112451424023) 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, 1703809423 + ... + 1703809488.
It is an arithmetic number, because the mean of its divisors is an integer number (20445713472).
Almost surely, 2112451424063 is an apocalyptic number.
112451424063 is a deficient number, since it is larger than the sum of its proper divisors (51114283713).
112451424063 is a wasteful number, since it uses less digits than its factorization.
112451424063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3407618925.
The product of its (nonzero) digits is 23040, while the sum is 33.
Adding to 112451424063 its reverse (360424154211), we get a palindrome (472875578274).
The spelling of 112451424063 in words is "one hundred twelve billion, four hundred fifty-one million, four hundred twenty-four thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •