Base | Representation |
---|---|
bin | 110000111100100010… |
… | …0011011111111011001 |
3 | 101001022022210122120210 |
4 | 1201321010123333121 |
5 | 3210231231441330 |
6 | 120142001041333 |
7 | 10410506561310 |
oct | 1417104337731 |
9 | 331268718523 |
10 | 105110421465 |
11 | 40639102415 |
12 | 18455326249 |
13 | 9bb14c047a |
14 | 5131a67277 |
15 | 2b02c038b0 |
hex | 187911bfd9 |
105110421465 has 16 divisors (see below), whose sum is σ = 192201913728. Its totient is φ = 48050478336.
The previous prime is 105110421463. The next prime is 105110421503. The reversal of 105110421465 is 564124011501.
It is not a de Polignac number, because 105110421465 - 21 = 105110421463 is a prime.
It is a super-2 number, since 2×1051104214652 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105110421463) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 500525712 + ... + 500525921.
It is an arithmetic number, because the mean of its divisors is an integer number (12012619608).
Almost surely, 2105110421465 is an apocalyptic number.
105110421465 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105110421465 is a deficient number, since it is larger than the sum of its proper divisors (87091492263).
105110421465 is a wasteful number, since it uses less digits than its factorization.
105110421465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001051648.
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 105110421465 its reverse (564124011501), we get a palindrome (669234432966).
The spelling of 105110421465 in words is "one hundred five billion, one hundred ten million, four hundred twenty-one thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •