Base | Representation |
---|---|
bin | 110001000000011010… |
… | …0011000101101011111 |
3 | 101001122101102211202121 |
4 | 1202000310120231133 |
5 | 3211013022301310 |
6 | 120202523403411 |
7 | 10413645623215 |
oct | 1420064305537 |
9 | 331571384677 |
10 | 105240431455 |
11 | 406a5530895 |
12 | 18490983567 |
13 | 9c02410663 |
14 | 514502acb5 |
15 | 2b0e3350da |
hex | 1880d18b5f |
105240431455 has 24 divisors (see below), whose sum is σ = 138487285872. Its totient is φ = 76507393536.
The previous prime is 105240431419. The next prime is 105240431479. The reversal of 105240431455 is 554134042501.
It is not a de Polignac number, because 105240431455 - 27 = 105240431327 is a prime.
It is a super-2 number, since 2×1052404314552 (a number of 23 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 105240431455.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 664617 + ... + 807586.
It is an arithmetic number, because the mean of its divisors is an integer number (5770303578).
Almost surely, 2105240431455 is an apocalyptic number.
105240431455 is a deficient number, since it is larger than the sum of its proper divisors (33246854417).
105240431455 is a wasteful number, since it uses less digits than its factorization.
105240431455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1472283 (or 1472254 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 34.
Adding to 105240431455 its reverse (554134042501), we get a palindrome (659374473956).
The spelling of 105240431455 in words is "one hundred five billion, two hundred forty million, four hundred thirty-one thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •