Base | Representation |
---|---|
bin | 11000000001011010010001… |
… | …110000101100011110011101 |
3 | 111212002001020201002101012110 |
4 | 120001122101300230132131 |
5 | 102321432301024232123 |
6 | 1012410544032224233 |
7 | 31152651516252642 |
oct | 3001322160543635 |
9 | 455061221071173 |
10 | 105650051008413 |
11 | 30732a3155969a |
12 | ba2383039b079 |
13 | 46c49ac356802 |
14 | 1c136bdc49dc9 |
15 | c33300e2c493 |
hex | 601691c2c79d |
105650051008413 has 8 divisors (see below), whose sum is σ = 141645003930976. Its totient is φ = 70044232712400.
The previous prime is 105650051008373. The next prime is 105650051008457. The reversal of 105650051008413 is 314800150056501.
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 105650051008413 - 28 = 105650051008157 is a prime.
It is a super-2 number, since 2×1056500510084132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105650051008013) 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, 97283656003 + ... + 97283657088.
It is an arithmetic number, because the mean of its divisors is an integer number (17705625491372).
Almost surely, 2105650051008413 is an apocalyptic number.
It is an amenable number.
105650051008413 is a deficient number, since it is larger than the sum of its proper divisors (35994952922563).
105650051008413 is a wasteful number, since it uses less digits than its factorization.
105650051008413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194567313275.
The product of its (nonzero) digits is 72000, while the sum is 39.
The spelling of 105650051008413 in words is "one hundred five trillion, six hundred fifty billion, fifty-one million, eight thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •