Base | Representation |
---|---|
bin | 100110101101111011010011… |
… | …1101011111001001111011111 |
3 | 1122122211120022200101121111101 |
4 | 1031123312213223321033133 |
5 | 324114243331201302310 |
6 | 3204152441105333531 |
7 | 131506624566054250 |
oct | 11533664753711737 |
9 | 1578746280347441 |
10 | 340563655103455 |
11 | 99572264914403 |
12 | 322436270372a7 |
13 | 118050268ab924 |
14 | 60155241dcb27 |
15 | 2958c9775a43a |
hex | 135bda7af93df |
340563655103455 has 16 divisors (see below), whose sum is σ = 467061711303744. Its totient is φ = 233527871347200.
The previous prime is 340563655103453. The next prime is 340563655103467. The reversal of 340563655103455 is 554301556365043.
It is not a de Polignac number, because 340563655103455 - 21 = 340563655103453 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 340563655103396 and 340563655103405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (340563655103453) 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, 25516522 + ... + 36499591.
It is an arithmetic number, because the mean of its divisors is an integer number (29191356956484).
Almost surely, 2340563655103455 is an apocalyptic number.
340563655103455 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
340563655103455 is a deficient number, since it is larger than the sum of its proper divisors (126498056200289).
340563655103455 is a wasteful number, since it uses less digits than its factorization.
340563655103455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62173026.
The product of its (nonzero) digits is 48600000, while the sum is 55.
The spelling of 340563655103455 in words is "three hundred forty trillion, five hundred sixty-three billion, six hundred fifty-five million, one hundred three thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •