Base | Representation |
---|---|
bin | 10111111100011101111010… |
… | …000000101111001010011001 |
3 | 111210212120102100222111001100 |
4 | 113330131322000233022121 |
5 | 102300401044114103103 |
6 | 1011550523523542013 |
7 | 31116264435456330 |
oct | 2774357200571231 |
9 | 453776370874040 |
10 | 105310350144153 |
11 | 30611961248480 |
12 | b989a2722a909 |
13 | 469b95342cc5b |
14 | 1c01096166d17 |
15 | c2956d1745a3 |
hex | 5fc77a02f299 |
105310350144153 has 48 divisors (see below), whose sum is σ = 199631376921600. Its totient is φ = 51827376687840.
The previous prime is 105310350144101. The next prime is 105310350144211. The reversal of 105310350144153 is 351441053013501.
105310350144153 is a `hidden beast` number, since 1 + 0 + 5 + 3 + 10 + 350 + 144 + 153 = 666.
It is not a de Polignac number, because 105310350144153 - 213 = 105310350135961 is a prime.
It is a super-2 number, since 2×1053103501441532 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105310350144553) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3999012813 + ... + 3999039146.
It is an arithmetic number, because the mean of its divisors is an integer number (4158987019200).
Almost surely, 2105310350144153 is an apocalyptic number.
It is an amenable number.
105310350144153 is a deficient number, since it is larger than the sum of its proper divisors (94321026777447).
105310350144153 is a wasteful number, since it uses less digits than its factorization.
105310350144153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7998052002 (or 7998051999 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The spelling of 105310350144153 in words is "one hundred five trillion, three hundred ten billion, three hundred fifty million, one hundred forty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •