Base | Representation |
---|---|
bin | 10111111001111010110011… |
… | …110100111100101011111111 |
3 | 111210020211101200220020201202 |
4 | 113321322303310330223333 |
5 | 102240013420434120330 |
6 | 1011334242315530115 |
7 | 31100524631023121 |
oct | 2771726364745377 |
9 | 453224350806652 |
10 | 105135226473215 |
11 | 30554665524514 |
12 | b95bab275993b |
13 | 4688294b36523 |
14 | 1bd6801c39211 |
15 | c24c1dae4445 |
hex | 5f9eb3d3caff |
105135226473215 has 4 divisors (see below), whose sum is σ = 126162271767864. Its totient is φ = 84108181178568.
The previous prime is 105135226473191. The next prime is 105135226473253. The reversal of 105135226473215 is 512374622531501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 105135226473215 - 210 = 105135226472191 is a prime.
It is a super-2 number, since 2×1051352264732152 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105135226473215.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10513522647317 + ... + 10513522647326.
It is an arithmetic number, because the mean of its divisors is an integer number (31540567941966).
Almost surely, 2105135226473215 is an apocalyptic number.
105135226473215 is a deficient number, since it is larger than the sum of its proper divisors (21027045294649).
105135226473215 is an equidigital number, since it uses as much as digits as its factorization.
105135226473215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21027045294648.
The product of its (nonzero) digits is 1512000, while the sum is 47.
The spelling of 105135226473215 in words is "one hundred five trillion, one hundred thirty-five billion, two hundred twenty-six million, four hundred seventy-three thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •