Base | Representation |
---|---|
bin | 110000111010011111… |
… | …1011110011101101111 |
3 | 101001010120002002110110 |
4 | 1201310333132131233 |
5 | 3210111223341030 |
6 | 120131114511103 |
7 | 10406016240663 |
oct | 1416477363557 |
9 | 331116062413 |
10 | 105042012015 |
11 | 40603528386 |
12 | 18436435493 |
13 | 9ba028a8c5 |
14 | 512693a8a3 |
15 | 2aebbde1b0 |
hex | 1874fde76f |
105042012015 has 48 divisors (see below), whose sum is σ = 174194424288. Its totient is φ = 54032339712.
The previous prime is 105042011933. The next prime is 105042012041. The reversal of 105042012015 is 510210240501.
It is not a de Polignac number, because 105042012015 - 27 = 105042011887 is a prime.
It is a super-2 number, since 2×1050420120152 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105042011982 and 105042012000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2748417 + ... + 2786373.
It is an arithmetic number, because the mean of its divisors is an integer number (3629050506).
Almost surely, 2105042012015 is an apocalyptic number.
105042012015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
105042012015 is a deficient number, since it is larger than the sum of its proper divisors (69152412273).
105042012015 is an equidigital number, since it uses as much as digits as its factorization.
105042012015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38136 (or 38077 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 21.
Adding to 105042012015 its reverse (510210240501), we get a palindrome (615252252516).
The spelling of 105042012015 in words is "one hundred five billion, forty-two million, twelve thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •