Base | Representation |
---|---|
bin | 110001001000100100… |
… | …0010111000100001010 |
3 | 101002100110101210121121 |
4 | 1202101020113010022 |
5 | 3212043102244200 |
6 | 120250021225454 |
7 | 10423511035456 |
oct | 1422110270412 |
9 | 332313353547 |
10 | 105514103050 |
11 | 40825a62364 |
12 | 1854856228a |
13 | 9c47020705 |
14 | 516d509666 |
15 | 2b28392e1a |
hex | 189121710a |
105514103050 has 24 divisors (see below), whose sum is σ = 200820334176. Its totient is φ = 41224113840.
The previous prime is 105514103027. The next prime is 105514103059. The reversal of 105514103050 is 50301415501.
It is a happy number.
It is a super-2 number, since 2×1055141030502 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (105514103059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24536014 + ... + 24540313.
It is an arithmetic number, because the mean of its divisors is an integer number (8367513924).
Almost surely, 2105514103050 is an apocalyptic number.
105514103050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105514103050 is a deficient number, since it is larger than the sum of its proper divisors (95306231126).
105514103050 is a wasteful number, since it uses less digits than its factorization.
105514103050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49076382 (or 49076377 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
Adding to 105514103050 its reverse (50301415501), we get a palindrome (155815518551).
The spelling of 105514103050 in words is "one hundred five billion, five hundred fourteen million, one hundred three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •