Base | Representation |
---|---|
bin | 110001001000100110… |
… | …0111110011101110010 |
3 | 101002100112200021100221 |
4 | 1202101030332131302 |
5 | 3212043410004020 |
6 | 120250103203254 |
7 | 10423524235162 |
oct | 1422114763562 |
9 | 332315607327 |
10 | 105515313010 |
11 | 40826709428 |
12 | 18548a4652a |
13 | 9c47355373 |
14 | 516d7425a2 |
15 | 2b285316aa |
hex | 189133e772 |
105515313010 has 8 divisors (see below), whose sum is σ = 189927563436. Its totient is φ = 42206125200.
The previous prime is 105515312977. The next prime is 105515313017. The reversal of 105515313010 is 10313515501.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 104576564689 + 938748321 = 323383^2 + 30639^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1055153130102 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105515313017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5275765641 + ... + 5275765660.
Almost surely, 2105515313010 is an apocalyptic number.
105515313010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105515313010 is a deficient number, since it is larger than the sum of its proper divisors (84412250426).
105515313010 is a wasteful number, since it uses less digits than its factorization.
105515313010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10551531308.
The product of its (nonzero) digits is 1125, while the sum is 25.
Adding to 105515313010 its reverse (10313515501), we get a palindrome (115828828511).
The spelling of 105515313010 in words is "one hundred five billion, five hundred fifteen million, three hundred thirteen thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •