Base | Representation |
---|---|
bin | 10111111001110001011001… |
… | …000101011010111100110000 |
3 | 111210012212021221201222222212 |
4 | 113321301121011122330300 |
5 | 102234332213204131344 |
6 | 1011325451041151252 |
7 | 31100016220360436 |
oct | 2771613105327460 |
9 | 453185257658885 |
10 | 105125114130224 |
11 | 30550346358561 |
12 | b959b5002b528 |
13 | 4687342aa3416 |
14 | 1bd6122bd0d56 |
15 | c2482ae4479e |
hex | 5f9c5915af30 |
105125114130224 has 20 divisors (see below), whose sum is σ = 214399903818840. Its totient is φ = 49796106693120.
The previous prime is 105125114130221. The next prime is 105125114130233. The reversal of 105125114130224 is 422031411521501.
It is a super-2 number, since 2×1051251141302242 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105125114130221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 172903147937 + ... + 172903148544.
It is an arithmetic number, because the mean of its divisors is an integer number (10719995190942).
Almost surely, 2105125114130224 is an apocalyptic number.
It is an amenable number.
105125114130224 is an abundant number, since it is smaller than the sum of its proper divisors (109274789688616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105125114130224 is a wasteful number, since it uses less digits than its factorization.
105125114130224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345806296508 (or 345806296502 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 32.
Adding to 105125114130224 its reverse (422031411521501), we get a palindrome (527156525651725).
The spelling of 105125114130224 in words is "one hundred five trillion, one hundred twenty-five billion, one hundred fourteen million, one hundred thirty thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •